Combinatorica Package >

ShortestPathSpanningTree


constructs a shortest-path spanning tree rooted at , so that a shortest path in graph from to any other vertex is a path in the tree.
  • The default is Algorithm->Automatic. In this case, depending on whether edges have negative weights and depending on the density of the graph, the algorithm chooses between BellmanFord and Dijkstra.
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF