Skip to content

MERN stack application that calculates the shortest bus route between two stops in and around Gainesville, FL

Notifications You must be signed in to change notification settings

Brendan-Fisher/RTSRR

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

76 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

RTS Route Runners

RTS Route Runners is an application built on the MERN stack that compares the efficiency of the BFS and Djikstra's pathfinding algorithm for finding the most efficient route from one bus stop to another in the Gainesville, FL area.

Motivation

We were motivated to create this project for our COP3530 Data Structures course. This project represents the final project for this course in which we were tasked with comparing the performance of either two data structures or two algorithms

Build Status

Still under development

Tech/framework used

Built with:

Resources from

Features

  • Seamless integration of leaflet map and markers for selecting start and destination nodes
  • Lightweight for browser as pathfinding is done on express backend

Credits

Coding Garden: Building a Maps App with Leaflet

About

MERN stack application that calculates the shortest bus route between two stops in and around Gainesville, FL

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •