Expand description
Adjacency matrix graph implementation.
Structs§
- Matrix
Graph - Graph represented as Adjacency Matrix. Directly support both direct and undirect graphs. This representation is efficient (fast) in almost any operation at the cost of a, in certain case, inefficient memory usage. The memory footprint of a MatrixGraph is always O(|N|²) where |N| is the number of nodes and is the number of arcs in the graph.