]> dxcluster.org Git - spider.git/commit
New improved route finding algorithm
authorDirk Koopman <djk@tobit.co.uk>
Tue, 24 Jun 2008 18:36:57 +0000 (19:36 +0100)
committerDirk Koopman <djk@tobit.co.uk>
Tue, 24 Jun 2008 18:36:57 +0000 (19:36 +0100)
commitc1540ccd7990ec4bd151604dd63583d19fe4d0f6
tree00b04f92cd6bcb1d73c55605498c12126a81f0d3
parent7a3918d750c1afaf42ab26eb89a7df9033ca9f37
New improved route finding algorithm

This is what Changes says:

Change the route finding algorithm completely. No more recursion. No more
tree searching. It now gives you answers even on a partial cluster map. Oh
and the answers are correct, instead on completely random.

Also completely remove RouteDB from the equation.
Also change sh/newc to default to node map rather than node+user map.
14 files changed:
Changes
cmd/Commands_en.hlp
cmd/ping.pl
cmd/show/newconfiguration.pl
cmd/show/route.pl
perl/DXProt.pm
perl/DXProtHandle.pm
perl/DXUtil.pm
perl/DXXml.pm
perl/Route.pm
perl/Route/Node.pm
perl/RouteDB.pm [deleted file]
perl/Version.pm
perl/cluster.pl