Note: Implementation of operations on graphs using adjacency matrix is simple as compared to adjacency
list. In fact, adjacency list would require the extra overhead of maintaining pointers. Moreover, the linked lists
connected to vertices are independent and it would be difficult to establish cross-relationship between the
vertices contained on different lists, which is otherwise possible by following a column in adjacency matrix.
8.4.4 Spanning Trees
A connected undirected graph has the following two properties:
nere exists a path from every node to every other node.
ne edges have no associated directions.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.