Description

A graph is a mathematical object consisting of connections (edges) between points (vertices). Graphs are used fairly often in computer science, because they can model many of the networks that arise from real-world data. In this project, we will use a technique called Dijkstra's algorithm to find the shortest path across a city.

Example output for New York City; the shortest path from the northwest to the southeast in marked in red.

Topics

• Graphs
• Dijkstra's algorithm
• Records
• Nested classes
• Hash-maps and hash-sets
• API usage

Instructional materials

BRIDGES instructors: To access teacher files or solution files, use the Bridges_Users Shared Drive. If you do not already have access, please contact iuse-bridges-group@uncc.edu.

Student files

• Street Map Student Worksheet
• Main.java
• StreetMap.java

Teacher files

• Street Map Teacher Walkthrough
• Street Map Worksheet Answer Key
• Main.java
• StreetMap.java

Documentation

• Bridges [Java]
• Color [Java]
• Element [Java]
• GraphAdjList [Java]
• Edge [Java]
• DataSource [Java]
• OsmVertex [Java]
• OsmEdge [Java]