https://github.com/volfpeter/bfs-shortest-path

Breadth-first search based shortest path finding algorithm that allows negative edge weights.
https://github.com/volfpeter/bfs-shortest-path

bfs bfs-algorithm breadth-first-search graph graph-algorithms python python3 shortest-path shortest-path-problem shortest-pathfinding-algorithm

Last synced: 9 months ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/volfpeter/bfs-shortest-path
• Owner: volfpeter
• License: mit
• Created: 2017-10-09T15:59:12.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2019-03-09T20:04:24.000Z (almost 7 years ago)
• Last Synced: 2025-02-05T12:25:02.643Z (11 months ago)
• Topics: bfs, bfs-algorithm, breadth-first-search, graph, graph-algorithms, python, python3, shortest-path, shortest-path-problem, shortest-pathfinding-algorithm
• Language: Python
• Size: 3.91 KB
• Stars: 0
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.rst
  • License: LICENSE.txt

Awesome Lists containing this project

README

          
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_.

.. _igraph: http://igraph.org

.. _installation: http://igraph.org/python/doc/tutorial/install.html#installing-igraph

.. _license: https://choosealicense.com/licenses/mit/