#ifndef ALGO_H
#define ALGO_H

class Graph;
class Node;
class Result;

/**
 * Calculate the shortest path between start and end in the graph.
 *
 * Note: modifies graph nodes (just their distance and visited members)
 * so the arguments are not const.  Of course, in real life you'd store
 * these somewhere else.
 */
Result dijkstra( Graph& graph, Node& start, Node& end );

#endif