Skip to content

Breadth-first search based shortest path finding algorithm that allows negative edge weights.

License

Notifications You must be signed in to change notification settings

MarvinGachoka/bfs-shortest-path

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

BFS Shortest Path

Breadth-first search based shortest path finding algorithm that works even if the graph has edges with negative weights.

Dependencies

The algorithm uses igraph graph objects. See the installation instructions on the igraph project's website.

License - MIT

The library is open-sourced under the conditions of the MIT license.

About

Breadth-first search based shortest path finding algorithm that allows negative edge weights.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%