GeeksforGeeks » Miscellaneous
Graph representations
(2 posts)-
What r the differencces between following representations of Graph
1) Adjacency List Representation
2) Adjacency Matrix RepresentationAre there any problems or standard algos which work for one representation and not for other?
-
In Genereal, Linked List representation is used for sparse graphs (Graphs where connectevity between nodes is less) and Matrix representation is used for dense graphs.
Floyd Warshall All Pair Shortest Path is one algo which works only with Adjacency Matrix Representation.
Reply
You must log in to post.
