Module graph::walkers

Implementations of the Walker<T> trait for various traversal algorithms.

You may want to take a look at:

• The Walker<Ix> trait
• The WalkerState enumerator
• Each of the strategies implementation their corresponding modules.

Re-exports

• pub use beam::*;
• pub use best::*;
• pub use bidirectional::*;
• pub use breadth::*;
• pub use depth::*;
• pub use hill::*;
• pub use sim_annealing::*;
• pub use super::*;

Modules

• beam
  The Beam strategy implementation
• best
  The best first strategy implementation. Various strategies derive from the best first strategy For example Dijkstra, A*, etc.
• bidirectional
  Bidirectional search using any of the methods above
• breadth
  The BFS stategy implementation
• depth
  The DFS strategy implementation. The route is random
• hill
  The hill ans stochastic hill implementation
• sim_annealing
  A simulation of the traveler problem

Enums

• WalkerState
  State interface for Walker machines.

Traits

• Walker
  The Walker trait. All solution-searching strategies must implement this trait.