Commit ffefc6e4 authored by Bertrand Néron's avatar Bertrand Néron


parent 7eb476c2
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 and
* *graph* store *nodes*
* each *node* have an unique id and knows its neighbors
## The second implementation and
* *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
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment