GitHub - mmehta17/most_efficient_path: an algorithm for finding the shortest paths between nodes in a graph, which may represent road networks.

mmehta17 / most_efficient_path Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

an algorithm for finding the shortest paths between nodes in a graph, which may represent road networks.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
algorithms		algorithms
data		data
java		java
fib_timings.txt		fib_timings.txt
readme.txt		readme.txt
requirements.txt		requirements.txt
test_main.py		test_main.py

Repository files navigation

CS 430 Project on Shortest Path

Written in Python 2.7

Implemented:
	Utilities:
	- Basic Timing Functions
	- Plotting Libraries:
	- Lots of Test Cases
	- Graphing Library for all-pairs shortest paths
	
	Data Structures:
	- Generation of Random Adjacency Matrix
	- Heap
	
	Algorithms: 
	- All algorithms in Java
	- Dijkstra (list and heap and fib)
	- Bellman Ford (most naive)
	- Bellman Ford (less naive - only look at relaxed nodes)
	- Floyd-Warshal (most naive)
	- Johnsons

To Implement:
	- A*


Required packages: 
- numpy
- line_profiler
- matplotlb