How sakshi-meena/travel-planner-using-graph works
Project type and purpose
• This is a small full-stack “Travel Route Optimization” application.
• Backend: C++ command-line program (Main.cpp + modules) implementing graph algorithms (Dijkstra, BFS, DFS).
• Frontend: a static HTML page (output.html or index.html) acting as the UI for input and showing results.
File structure
• Top-level modules:
• Parser.h / FileOperations.h → CSV reading (cities.csv, routes.csv) and file I/O.
• Data models: Location.h (node), Route.h (edge).
• GraphFunctions.h → graph construction and algorithms (adjacency list, priority queue, min-heap).
• Main.cpp → orchestrates: read CSV → build graph → run algorithm → write HTML output.
• travel.make → build script.
• Data files:
• cities.csv, routes.csv (source data)
• output.html (generated UI)
• README.md describes use-cases, tech stack, and workflow.
README for additional insights
• Purpose: find shortest/cheapest path for plane or bus travel.
• Algorithms: Dijkstra (priority queue), BFS, DFS.
• Data structures: adjacency list graph, min-heap.
Elements
• Clear labels for each module/component.
• Blue for UI
• Green for core application modules
• Orange for data sources
• Yellow for algorithms
Detailed capture
• Parser
• Data Models
• Graph Engine (list out Dijkstra/BFS/DFS)
• FileOperations
• Main Controller
• How the Makefile orchestrates compilation.
• Test data sources (cities.csv, routes.csv) and final HTML output.