How chandan291/kit205-503028 works
This is a coursework collection; the clearest integrated application is an emergency-vehicle routing comparison. Its workflow generates a weighted city graph, runs Dijkstra and A* for routes, and reports path and benchmark results. The tree also contains a separate PageRank exercise, shown as an independent branch. Routing links reflect the sampled main program; algorithm internals were not sampled, so their dependencies are not inferred.
Main entry points: main.c Routing CLI · Main.c PageRank Runner · dijkstra.c Dijkstra · astar.c A* Search
Components 12
Emergency Routing
- Routing CLI
Assign2fix/main.c - Dijkstra
Assign2fix/dijkstra.c - A* Search
Assign2fix/astar.c - Route and Benchmarks
Assign2fix/main.c
Graph Model
- City Generator
Assign2fix/graph_generator.c - Weighted Graph
Assign2fix/graph.c - Priority Queue
Assign2fix/priority_queue.c
PageRank Exercise
- PageRank Runner
week 9/Main.c - PageRank Graph API
week 9/graph.c - Rank Output
week 9/Main.c
Other components
- User
- Edge-list Input
Connections 12
- User → Routing CLI: select mode
- Routing CLI → City Generator: generate graph
- City Generator → Weighted Graph: build graph
- Routing CLI → Dijkstra: run search
- Routing CLI → A* Search: run search
- Dijkstra → Route and Benchmarks: return results
- A* Search → Route and Benchmarks: return results
- Routing CLI → Route and Benchmarks: report benchmarks
- Edge-list Input → PageRank Runner: read input
- PageRank Runner → PageRank Graph API: build graph
- PageRank Runner → PageRank Graph API: calculate ranks
- PageRank Runner → Rank Output: print ranks