CU Tunnels
Jeremy Friesen, Tanner Cormier, Zainab Husain, Randiv Waduge
About us
Problem Statement
Residence
Athletics
Academics
Admin
to any building on campus
01
03
04
02
Project Overview
my code
Tech Stack
Graph Theory
B
A
C
D
The study of the properties and applications of graphs
Implementation
User Interaction
Cytoscape
Shortest Path Algorithm
We utilize Dijkstra’s algorithm to calculate the shortest path between nodes
Library for JavaScript used for graph visualization
Functionality for calculating edge to node connections
The optimal tunnel route is displayed to students and faculty when any two buildings are selected
Challenges
Tunnel Time Accuracy
User Feedback
Scalability / Accessibility
App Marketing
What sets �us apart?
A simple yet effective user interface, and cross-compatible on any device
Implementation of dijkstra’s algorithm to map the most optimal route to and from your classes
Our project provides real utility, helping Carleton students quickly determine the fastest route from their current location on campus to their destination.
Ease-Of-Use
Efficient Pathfinding
Direct Student Impact