| Author |
Comment/Response |
pooya
|
 05/31/08 12:12pm
the shortest-path spannig tree of a cycle on 4 vertices are a path on 4 vertices.
I have graph G which is a Cycle on 4 labeled vertices that the shortest-path spanning tree rooted on vertex 4 of G constructed by "ShortestPathSpanningTree[..]" function is not corect.
I attached my .nb file
Attachment: problem.nb, URL: , |
|
