G = (V, E) where:
ā¢ V = {vā, vā, ..., vā} (Vertices/Rooms)
ā¢ E = {eā, eā, ..., eā} (Edges/Connections)
ā¢ |V| = Number of vertices
ā¢ |E| = Number of edges
Interaction Mode:
Analysis Tools:
Campus Legend
Classroom
Laboratory
Office
Library
Auditorium
MST (Wiring)
Sensor Coverage
Shortest Path
Rooms: 0
Pathways: 0
Active Analysis: None
Mode: Select
Graph Analysis Tools
Minimum Spanning Tree
Finds optimal wiring layout that connects all rooms with minimal total cable length using Prim's algorithm.
Click to find optimal electrical wiring paths across campus.
Sensor Placement
Finds minimum set of rooms to place occupancy sensors so every room is monitored (Dominating Set problem).
Click to find optimal sensor placement locations.
Shortest Path
Finds shortest route between two rooms using Dijkstra's algorithm for emergency response planning.
Select start and end rooms to find shortest pathway.