Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
What's new
7
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Open sidebar
Bertrand NÉRON
algo
Commits
ffefc6e4
Commit
ffefc6e4
authored
Sep 02, 2019
by
Bertrand Néron
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
✏
add README
parent
7eb476c2
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
24 additions
and
0 deletions
+24
-0
Graph/graph/README.md
Graph/graph/README.md
+24
-0
No files found.
Graph/graph/README.md
0 → 100644
View file @
ffefc6e4
We propose to modelize a Non Directed Graph
we must be able to:
*
create a graph
*
add nodes to this graph
*
connect nodes with edges
once this step is done we will implement to graph search algorithms:
*
Depth First Search
*
Breadth First Search
I propose two graph implementation
## The first implementation graph_1.py and main_1.py
*
*graph*
store
*nodes*
*
each
*node*
have an unique id and knows its neighbors
## The second implementation graph_2.py and main_2.py
*
*graph*
store nodes, and edges between nodes
*
*nodes*
knows only its properties here, an unique id
we see that the 2 search path algorithms
*BFS*
and
*DFS*
do not change whatever the graph implementation.
\ No newline at end of file
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment