Spanning Tree
a sub graph of a connected graph that contains all vertices, but no cycles
Notes tagged GraphTheory
-
-
-
Dijkstra's Shortest Path Algorithm
An elegant algorithm for finding the shortest path between nodes in a graph.
a sub graph of a connected graph that contains all vertices, but no cycles
An elegant algorithm for finding the shortest path between nodes in a graph.
