A Simple Map Functionality : ECE650 Assignment 3

This project aims to develop a simple map utility to find shortest path beween two places. The shortest path is found by using Dijkstra's algorithm.

The map is implemented in roadmap.c and is provided with a header file roadmap.h.

Functionalities Supported

The roadmap supports adding:

• Vertex
• Edge
• Add an Edge Event
• Name a Road between edges
• Lookup for suggestions for Vertex Name in the Map
• Find the shortest distance between two vertex
• Store the map into a file
• Retreive the map from a file previously saved using Store
• Print the Graph Info

A sample file is also provided named main.c which showcases the usage of the different APIs

For testing purposes, two sample maps are created in sample1.c and sample2.c. Scripts are created to run them: ./run-sample1.sh and ./run-sample2.sh

Documentation

Run doxygen Doxyfile

Compile

Run make

Run

./runmap

Learning

The project aided the group to explore, and learn:

• Dynamic Data Structures in C
• Dijkstra's algorithm using directed weighted graph
• Levenshtein distance
• Development in a *nix Machine (Ubuntu/Mac)
• API in C and use of header file
• Vim Editor
• Makefile
• Bash scripts
• Git
• Doxygen
• Markdown

This document was generated using Markdown and Doxygen.