Network Analysis Tools - Help on Pathfinder

Content

Description

Credits

Input graph

Input nodes

Graph formats

Options

Advanced options

Output

Email

Next steps panel

Limitations

Web service

Standalone tool

Literature

  1. Jimenez, V.M., and Marzal, A. (1999). "Computing the K Shortest Paths: a New Algorithm and an Experimental Comparison", Proc. 3rd Int. Worksh. Algorithm Engineering (WAE 1999)
  2. Duin, C.W., Volgenant, A., and Voß, S. (2004). "Solving group Steiner problems as Steiner problems." European Journal of Operational Research 154, 323-329.