A small C-based street navigation demonstration project. It loads a graph of intersections and streets from text files and provides an interactive menu to display the graph, find shortest paths (unweighted BFS and weighted Dijkstra), explore connectivity, search intersections within a distance, and toggle street availability.
- Load graph data (intersections and connections) from text files
- Display the adjacency list representation of the graph
- Find shortest path in an unweighted graph (BFS)
- Find shortest path in a weighted graph (Dijkstra)
- Query connectivity between two intersections
- Find intersections within a distance (meters) from a start
- Toggle a street (open/closed) between two intersections
git clone https://github.com/Dharani9018/Street_Navigation_System.git
cd Street_Navigation_System gcc main.c graph.c parser.c pathfinding.c -o Street_Navigation_System.exe Street_Navigation_System.exe