Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re: Graph Traversal

by MadraghRua (Vicar)
on Nov 11, 2000 at 02:45 UTC ( #41046=note: print w/ replies, xml ) Need Help??

in reply to Graph Traversal

Another alternative is to try a non-hierarchical binning approach. Use euclidian distances as a means of measuring distances between your grid, bin your distances in terms of distance between your important grids. Select the bin with the least travel cost, hopefully meaning it is optimized. You could use successive series of nodes to organize your moevments and help cut down on travel costs

Just do a web search on non-hierarchical analysis...

yet another biologist hacking perl....

Comment on Re: Graph Traversal

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (9)
As of 2015-11-25 22:42 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (692 votes), past polls