How githubansh/metro__ works
Project type and purpose
• This is a standalone C++ command-line application for “Metro__ Route Planner.”
• It models the Delhi Metro network as a graph and uses Dijkstra’s algorithm to compute shortest routes.
File structure
• Everything lives at the top level—no separate “src” or “lib” folders.
• Data files: DATA.csv, matrix.txt, nodes.txt, stationnames.txt hold the raw graph representation.
• main.cpp contains CLI input parsing, graph construction, algorithm invocation, and result output.
• colorcodes.txt and _config.yml likely hold presentation settings or styling info for visualization.
• main.exe is the compiled binary (not part of the design but shows the build target).
README for additional insights
• Confirms use of adjacency lists, priority queues, and Dijkstra’s algorithm.
• Emphasizes performance optimization and real-time route planning.
• Mentions CLI as the user interface and that the graph is visualized (presumably by external tool or post-processing).
Elements
• Clear labels (e.g., “Data Loader,” “Graph Model,” “Dijkstra Engine”).
• From User → CLI Parser
• CLI Parser → Data Loader & Configuration Module
• Data Loader → Graph Model
• CLI Parser → Dijkstra Engine → Graph Model
• Dijkstra Engine → Output Renderer → User
Detail
• That the Graph Model holds nodes and adjacency lists in memory.