1 / 6

ND Mapquest

This project aims to develop a program that calculates the shortest distance between two points on the Notre Dame campus using Dijkstra’s Algorithm. By employing Object-Oriented Programming (OOP) principles and utilizing Qt for graphics and widgets, we ensure an organized and modular design. Key components such as nodes, STL templates, vectors, and maps facilitate efficient coding and collaboration among team members. This approach not only simplifies code management but also enhances conceptual clarity, making navigation on campus intuitive.

azure
Télécharger la présentation

ND Mapquest

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ND Mapquest Patrick Raycroft “Chas” Jhin Ashley Taylor Matt Fitzgerald

  2. Overview Objective: To create a program which finds the shortest distance between two points on the ND campus using Dijkstra’s Algorithm OOP Elements used: Qt, Nodes, STL templates

  3. Object Oriented Elements -Qt graphics -Widget -Nodes -STL templates -Vectors, Maps

  4. Why OOP Helped -Helped organize code -Easier to conceptualize -STL -Modular design of C++ -Different people working on different things

  5. Questions?

More Related