Live graph map
Campus navigation network
Click any place
MAL0305
Discrete Structures / Discrete Mathematics
Graph theory + AI decision support
Interactive assignment project
Find the route.
See the logic.
Choose two places on the campus graph and let Dijkstra’s algorithm find the shortest walk. The route is calculated from the weighted graph and drawn directly on the map.
How to use itClick one node for the starting place, then click a second node for the final place. You can also type a route request in natural language.