Are you asking about traversal code, or how to build one, or what?
Kruskal's algorithm for a minimum spanning tree (shortest traversal) for a (connected weighted) graph is the first link below.
Prim's algorithm for same is the second link below.
Note that both are in pseudocode. Without specifying a language, this is the generic solution.
Where can i get the source codes for tree and graphs in c?
try googling it or yahooing it
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment