Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re: Recommendations for general methods/algorythms anyone?

by Odud (Pilgrim)
on May 22, 2001 at 18:28 UTC ( #82228=note: print w/replies, xml ) Need Help??

in reply to Recommendations for general methods/algorythms anyone?

Dictionary of Algorithms, Data Structures, and Problems is a fine way of spending an idle hour. Just a sample below to whet your appetite:
minimum spanning tree (definition)

Definition: A minimum-weight tree in a weighted graph which contains all of the graph's vertices.

See also Kruskal's algorithm, Prim's algorithm, Steiner minimum tree, spanning tree.

Note: A minimum spanning tree is a near-optimal solution to the traveling salesman problem. First find the minimum spanning tree. Then convert the tree to a path by traversing the tree, say by depth first search.
  • Comment on Re: Recommendations for general methods/algorythms anyone?

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://82228]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (6)
As of 2023-01-27 14:04 GMT
Find Nodes?
    Voting Booth?

    No recent polls found