bmssp

Name	bmssp JSON
Version	0.1.0 JSON
	download
home_page	None
Summary	Bounded Multi-Source Shortest Path algorithm breaking the sorting barrier
upload_time	2025-08-16 23:28:50
maintainer	None
docs_url	None
author	None
requires_python	>=3.8
license	Apache-2.0
keywords	graph shortest-path algorithms dijkstra optimization
VCS
bugtrack_url
requirements	No requirements were recorded.
Travis-CI	No Travis.
coveralls test coverage	No coveralls.

            # BMSSP: Bounded Multi-Source Shortest Path

[![PyPI version](https://badge.fury.io/py/bmssp.svg)](https://badge.fury.io/py/bmssp)

A Python implementation of the breakthrough **O(m log^(2/3) n)** shortest path algorithm that breaks the 60-year-old "
sorting barrier" for directed graphs.

### Based on the groundbreaking research: ["Breaking the Sorting Barrier for Directed Single-Source Shortest Paths"](https://arxiv.org/abs/2504.17033)

## 📦 Installation

```bash
pip install bmssp
```

## 🔥 Quick Start

# THIS IS NOT IMPLEMENTED YET

```python
import bmssp
import networkx as nx

# Create a graph
G = nx.DiGraph()
G.add_weighted_edges_from([(0, 1, 4), (0, 2, 2), (1, 2, 1), (2, 3, 5)])

# Find shortest paths from source 0
distances = bmssp.single_source_shortest_path(G, source=0)
print(distances)  # {0: 0, 1: 4, 2: 2, 3: 7}
```

            

Raw data

            {
    "_id": null,
    "home_page": null,
    "name": "bmssp",
    "maintainer": null,
    "docs_url": null,
    "requires_python": ">=3.8",
    "maintainer_email": "Guja Lomsadze <lomsadze.guja@gmail.com>",
    "keywords": "graph, shortest-path, algorithms, dijkstra, optimization",
    "author": null,
    "author_email": "Guja Lomsadze <lomsadze.guja@gmail.com>",
    "download_url": "https://files.pythonhosted.org/packages/a5/31/ee58830906baa621b4a1cc71580d0ce76b3a7fe8c6afb0170b1b65e20052/bmssp-0.1.0.tar.gz",
    "platform": null,
    "description": "# BMSSP: Bounded Multi-Source Shortest Path\n\n[![PyPI version](https://badge.fury.io/py/bmssp.svg)](https://badge.fury.io/py/bmssp)\n\nA Python implementation of the breakthrough **O(m log^(2/3) n)** shortest path algorithm that breaks the 60-year-old \"\nsorting barrier\" for directed graphs.\n\n### Based on the groundbreaking research: [\"Breaking the Sorting Barrier for Directed Single-Source Shortest Paths\"](https://arxiv.org/abs/2504.17033)\n\n## \ud83d\udce6 Installation\n\n```bash\npip install bmssp\n```\n\n## \ud83d\udd25 Quick Start\n\n# THIS IS NOT IMPLEMENTED YET\n\n```python\nimport bmssp\nimport networkx as nx\n\n# Create a graph\nG = nx.DiGraph()\nG.add_weighted_edges_from([(0, 1, 4), (0, 2, 2), (1, 2, 1), (2, 3, 5)])\n\n# Find shortest paths from source 0\ndistances = bmssp.single_source_shortest_path(G, source=0)\nprint(distances)  # {0: 0, 1: 4, 2: 2, 3: 7}\n```\n",
    "bugtrack_url": null,
    "license": "Apache-2.0",
    "summary": "Bounded Multi-Source Shortest Path algorithm breaking the sorting barrier",
    "version": "0.1.0",
    "project_urls": {
        "Bug Tracker": "https://github.com/GujaLomsadze/BMSSP/issues",
        "Documentation": "https://bmssp.readthedocs.io",
        "Homepage": "https://github.com/GujaLomsadze/BMSSP",
        "Repository": "https://github.com/GujaLomsadze/BMSSP"
    },
    "split_keywords": [
        "graph",
        " shortest-path",
        " algorithms",
        " dijkstra",
        " optimization"
    ],
    "urls": [
        {
            "comment_text": null,
            "digests": {
                "blake2b_256": "47d8ab830a06321fa8f57068255dbc60d91209d7a4663fd1214f69e781b0b367",
                "md5": "7b5584de6493e3f680966bb30f971845",
                "sha256": "8a4e04291058238d2ee1b8aba6ab1e171a17b94ac0475a8b2b3e6af22c0a436d"
            },
            "downloads": -1,
            "filename": "bmssp-0.1.0-py3-none-any.whl",
            "has_sig": false,
            "md5_digest": "7b5584de6493e3f680966bb30f971845",
            "packagetype": "bdist_wheel",
            "python_version": "py3",
            "requires_python": ">=3.8",
            "size": 7314,
            "upload_time": "2025-08-16T23:28:48",
            "upload_time_iso_8601": "2025-08-16T23:28:48.904273Z",
            "url": "https://files.pythonhosted.org/packages/47/d8/ab830a06321fa8f57068255dbc60d91209d7a4663fd1214f69e781b0b367/bmssp-0.1.0-py3-none-any.whl",
            "yanked": false,
            "yanked_reason": null
        },
        {
            "comment_text": null,
            "digests": {
                "blake2b_256": "a531ee58830906baa621b4a1cc71580d0ce76b3a7fe8c6afb0170b1b65e20052",
                "md5": "175f040be5030cee0d058261b4fb0621",
                "sha256": "030fc477062f07f7c5c4977bc87b283557d410eae840a64329a4c9c950b48870"
            },
            "downloads": -1,
            "filename": "bmssp-0.1.0.tar.gz",
            "has_sig": false,
            "md5_digest": "175f040be5030cee0d058261b4fb0621",
            "packagetype": "sdist",
            "python_version": "source",
            "requires_python": ">=3.8",
            "size": 7352,
            "upload_time": "2025-08-16T23:28:50",
            "upload_time_iso_8601": "2025-08-16T23:28:50.373304Z",
            "url": "https://files.pythonhosted.org/packages/a5/31/ee58830906baa621b4a1cc71580d0ce76b3a7fe8c6afb0170b1b65e20052/bmssp-0.1.0.tar.gz",
            "yanked": false,
            "yanked_reason": null
        }
    ],
    "upload_time": "2025-08-16 23:28:50",
    "github": true,
    "gitlab": false,
    "bitbucket": false,
    "codeberg": false,
    "github_user": "GujaLomsadze",
    "github_project": "BMSSP",
    "travis_ci": false,
    "coveralls": false,
    "github_actions": false,
    "lcname": "bmssp"
}