/* File: shortest_paths.h
 *
 * The interface to the shortest_path module
 */

/* shortest_path() - returns true if a path exists between node from and node
 *     to in the graph.  The other parameters are as follows:
 *     pathlength - returns the length of the path found
 *     pathnodes - returns the number of nodes in the path
 *     path - an array that is set to the path found.  path must be large enough
 *            to hold a shortest path
 *     new_graph - set to false if the previous call to shortest_path used the
 *                 same graph.  Then function will not recompute the paths.
 */
bool shortest_path(Graph *graph, int from, int to, int *pathlength,
                   int *pathnodes, int *path, bool new_graph);