6.3- Adjacency Matrix 04:17 6.4- Adjacency List 06:37 6.5- Exercise- Building a Graph 01:53 6.6- Solution- Adding Nodes and Edges 07:35 6.7- Solution- Removing Nodes and Edges 04:48 6.8- Traversal Algorithms 04:00 6.10- Exercise- Depth-first Traversal (Recursive) 01:30 6.11...
The two main structures for storing a static graph are the adjacency matrix and the adjacency list. For a network of n nodes, an adjacency matrix requires [Math Processing Error]O(n2) space complexity and is thus generally used only for small networks. Adjacency lists are typically used instea...
An adjacency matrix is usually a binary matrix with a 1 indicating that the two vertices have an edge between them. A connectivity matrix is usually a list of which vertex numbers have an edge between them. Adjacency matrixes are easier to compute certain kinds of algorithms over, but may re...