Skip to content

A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm

Notifications You must be signed in to change notification settings

prateek22sri/Graph-Delta-Stepping-SSSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

20 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Graph-Delta-Stepping-SSSP

A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm

This project has two main files:

  • deltaStepping.py
  • dijkstra.py

Both files are implementations of single source shortest path problem. Dijkstra'a algorithm was the original reference for solving single source shortest path problem but performed badly when it came to parallelization. Delta Stepping is one of the variants which incorporates concepts of Bellman Ford's algorithm along with dijkstra's algorithm to get a better performance for parallelization.

About

A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages