We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Read about different implementations for Graphs and their efficiency depending on the use, in this case using linked lists is enough cause you have to go throught all the data, in other cases maybe you want to find one Node really quick (O(1)) and in that case using matrix representation is better.
BFS: Shortest Reach in a Graph
You are viewing a single comment's thread. Return to all comments →
Read about different implementations for Graphs and their efficiency depending on the use, in this case using linked lists is enough cause you have to go throught all the data, in other cases maybe you want to find one Node really quick (O(1)) and in that case using matrix representation is better.
Here is some literature :P: Representing graphs