Shortest path tree

From Wikipedia, the free encyclopedia

A shortest path tree is a tree, in graph theory, that is constructed so that the distance between a root node and all other nodes is minimum. Dijkstra's algorithm computes the shortest path tree. Its applications extend to graph theory and network design. A known problem with using shortest path tree in network design is cost, reliability and bandwidth required at the central node.

Source: Wide Area Network Design by Robert S. Cahn

 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../s/h/o/Shortest_path_tree.html"