| Name | logarithma JSON |
| Version |
0.1.0
JSON |
| download |
| home_page | None |
| Summary | High-performance graph algorithms library featuring advanced shortest path algorithms |
| upload_time | 2025-08-15 15:15:00 |
| maintainer | None |
| docs_url | None |
| author | None |
| requires_python | >=3.8 |
| license | MIT License
Copyright (c) 2025 Can Akyıldırım
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
|
| keywords |
graph
algorithms
shortest-path
optimization
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
# 📐 Logarithma
> *Next-generation algorithms for computational optimization*
[](https://badge.fury.io/py/logarithma)
[](https://www.python.org/downloads/)
[](https://opensource.org/licenses/MIT)
**Logarithma** is a high-performance Python library that breaks traditional algorithmic barriers. Our flagship implementation features the groundbreaking **O(m log^{2/3} n)** shortest path algorithm, surpassing the classical Dijkstra's O(m + n log n) bound for the first time.
## ✨ Features
- 🚀 **Revolutionary SSSP**: First deterministic algorithm to break the sorting barrier
- 📊 **Multiple Domains**: Finance, logistics, social networks, telecommunications
- ⚡ **High Performance**: Optimized implementations with rigorous complexity analysis
- 🔬 **Research Ready**: Built for both academic research and production systems
- 🐍 **Pythonic**: Clean, intuitive API designed for modern Python
## 🎯 Quick Start
```python
import logarithma
# Revolutionary shortest path algorithm
distances = logarithma.paths.shortest_path(graph, source)
# Coming soon: Extended algorithmic toolkit
logarithma.optimization.solve()
logarithma.analysis.complexity()
Raw data
{
"_id": null,
"home_page": null,
"name": "logarithma",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.8",
"maintainer_email": null,
"keywords": "graph, algorithms, shortest-path, optimization",
"author": null,
"author_email": "Can AKYILDIRIM <akyildirimcan@gmail.com>",
"download_url": "https://files.pythonhosted.org/packages/74/e1/f975cf93344a50b66fa9bc1f4680e139aa561027faea953143a9c440ef10/logarithma-0.1.0.tar.gz",
"platform": null,
"description": "# \ud83d\udcd0 Logarithma\r\n\r\n> *Next-generation algorithms for computational optimization*\r\n\r\n[](https://badge.fury.io/py/logarithma)\r\n[](https://www.python.org/downloads/)\r\n[](https://opensource.org/licenses/MIT)\r\n\r\n**Logarithma** is a high-performance Python library that breaks traditional algorithmic barriers. Our flagship implementation features the groundbreaking **O(m log^{2/3} n)** shortest path algorithm, surpassing the classical Dijkstra's O(m + n log n) bound for the first time.\r\n\r\n## \u2728 Features\r\n\r\n- \ud83d\ude80 **Revolutionary SSSP**: First deterministic algorithm to break the sorting barrier\r\n- \ud83d\udcca **Multiple Domains**: Finance, logistics, social networks, telecommunications\r\n- \u26a1 **High Performance**: Optimized implementations with rigorous complexity analysis \r\n- \ud83d\udd2c **Research Ready**: Built for both academic research and production systems\r\n- \ud83d\udc0d **Pythonic**: Clean, intuitive API designed for modern Python\r\n\r\n## \ud83c\udfaf Quick Start\r\n\r\n```python\r\nimport logarithma\r\n\r\n# Revolutionary shortest path algorithm\r\ndistances = logarithma.paths.shortest_path(graph, source)\r\n\r\n# Coming soon: Extended algorithmic toolkit\r\nlogarithma.optimization.solve()\r\nlogarithma.analysis.complexity()\r\n",
"bugtrack_url": null,
"license": "MIT License\r\n \r\n Copyright (c) 2025 Can Aky\u0131ld\u0131r\u0131m\r\n \r\n Permission is hereby granted, free of charge, to any person obtaining a copy\r\n of this software and associated documentation files (the \"Software\"), to deal\r\n in the Software without restriction, including without limitation the rights\r\n to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\n copies of the Software, and to permit persons to whom the Software is\r\n furnished to do so, subject to the following conditions:\r\n \r\n The above copyright notice and this permission notice shall be included in all\r\n copies or substantial portions of the Software.\r\n \r\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\n SOFTWARE.\r\n ",
"summary": "High-performance graph algorithms library featuring advanced shortest path algorithms",
"version": "0.1.0",
"project_urls": {
"Bug Tracker": "https://github.com/softdevcan/logarithma/issues",
"Homepage": "https://github.com/softdevcan/logarithma",
"Repository": "https://github.com/softdevcan/logarithma"
},
"split_keywords": [
"graph",
" algorithms",
" shortest-path",
" optimization"
],
"urls": [
{
"comment_text": null,
"digests": {
"blake2b_256": "094f7460058814003b42bce542cc8102d32052eadb58279b1370c7dc41f7d2e4",
"md5": "9c24f0a6206312584a857a2e112d9015",
"sha256": "375d6874eb8b6ceb944bd94e8f1fd576b197c2c3b53d1c3e2a3542579b3b81ec"
},
"downloads": -1,
"filename": "logarithma-0.1.0-py3-none-any.whl",
"has_sig": false,
"md5_digest": "9c24f0a6206312584a857a2e112d9015",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.8",
"size": 7017,
"upload_time": "2025-08-15T15:14:59",
"upload_time_iso_8601": "2025-08-15T15:14:59.309805Z",
"url": "https://files.pythonhosted.org/packages/09/4f/7460058814003b42bce542cc8102d32052eadb58279b1370c7dc41f7d2e4/logarithma-0.1.0-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": null,
"digests": {
"blake2b_256": "74e1f975cf93344a50b66fa9bc1f4680e139aa561027faea953143a9c440ef10",
"md5": "8022e9aa35c827cb7aac8c0e00008c91",
"sha256": "493c7b9af4844daecabf988828c3b57cd4a96983594cf12eddb665216b9c1bd6"
},
"downloads": -1,
"filename": "logarithma-0.1.0.tar.gz",
"has_sig": false,
"md5_digest": "8022e9aa35c827cb7aac8c0e00008c91",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.8",
"size": 7240,
"upload_time": "2025-08-15T15:15:00",
"upload_time_iso_8601": "2025-08-15T15:15:00.958270Z",
"url": "https://files.pythonhosted.org/packages/74/e1/f975cf93344a50b66fa9bc1f4680e139aa561027faea953143a9c440ef10/logarithma-0.1.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2025-08-15 15:15:00",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "softdevcan",
"github_project": "logarithma",
"travis_ci": false,
"coveralls": false,
"github_actions": false,
"lcname": "logarithma"
}
