A minimum spanning tree / shortest path in a directed graph

Posted by mvid on Stack Overflow See other posts from Stack Overflow or by mvid
Published on 2010-05-10T06:20:38Z Indexed on 2010/05/10 6:24 UTC
Read the original article Hit count: 364

Given a directed graph with weighted edges, what algorithm can be used to give a sub-graph that has minimum weight, but allows movement from any vertex to any other vertex in the graph (under the assumption that paths between any two vertices always exist).

Does such an algorithm exist?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about minimum