Tswitch

This is an input file for the graph search. It defines a trivial weighted graph with three nodes and two arcs, then makes three shortest-path requests. The last request is not connected, so the program will show its cost as infinity.

fred -> barney 10
barney -> alice 8
@
fred => alice
fred => barney
alice => fred