[GAP Forum] shortest paths from s to every vertex of G
nicoletagramisteanu at yahoo.com
Sat Jan 3 19:10:01 GMT 2009
Can you tell me how can i make more efficient this problems?
We have a directed graph and a function of weight w we know that there is only one edge with a negative weight and that there is no cycle in the graph with negative weight we have s a vertex
We have to find an algorithm that find the length of all the shortest paths from s to every vertex of G
More information about the Forum