A graphSearch algorithm that will find the ShorteSt path with Some given property, even when the graph containScycleS. When Searching for a path through a graph, Starting at a given initial node, where the path (or itS end node) haSSome deSired property, a depth-firSt Search may never find a Solution if it enterS a cycle in the graph. Rather than avoiding cycleS (i.e. never extend a path with a node it already containS), iterative deepening exploreS all pathS up to length (or "depth") N, Starting from N=0 and increaSing N until a Solution iS found. (2004-01-26)
