How nicolasvoyez/tandijkstra works
TanDijkstra is a small console application that finds a shortest route between two transit stops. Its workflow reads stop and link data, builds a linked graph, runs Dijkstra’s algorithm using a geographic distance estimate, then prints the route’s stop names or “IMPOSSIBLE.” The graph separates input/output, transit-stop modeling, and shortest-path logic. Source excerpts show the principal calls; no README documents additional capabilities.
Main entry points: TanProgram.cs CLI workflow · Dijkstra.cs Dijkstra search · TanNode.cs Stop model · Node.cs Graph node state
Components 6
Console workflow
- CLI workflow
TanDijkstra/TanProgram.cs
Transit graph
- Stop model
TanDijkstra/TanNode.cs - Graph node state
TanDijkstra/Node.cs
Shortest path
- Dijkstra search
TanDijkstra/Dijkstra.cs - Transit distance
TanDijkstra/TanDijkstra.cs
Other components
- Console user
Connections 7
- Console user → CLI workflow: provides input
TanDijkstra/TanProgram.cs - CLI workflow → Stop model: parses stops
TanDijkstra/TanProgram.cs - Stop model → Graph node state: inherits state
TanDijkstra/TanNode.cs - CLI workflow → Dijkstra search: runs search
TanDijkstra/TanProgram.cs - Dijkstra search → Transit distance: requests distance
TanDijkstra/Dijkstra.cs - Dijkstra search → Graph node state: updates route state
TanDijkstra/Dijkstra.cs - CLI workflow → Console user: prints route
TanDijkstra/TanProgram.cs