Project description

Dijkstra's Algorithm Implementation

A simple Dijkstra's Algorithm implementation

Use the package manager pip to install the package.

pip install -i https://test.pypi.org/simple/ dijkstras-algorithm-TOMG-A

from dijkstra import *

NodeA=Node("A")
graph=Graph(NodeA)
dist,prev,_=Dijkstra(graph,NodeA)

Released under MIT by @TOMG-A.

These details have not been verified by PyPI

View statistics for this project via Libraries.io, or by using our public dataset on Google BigQuery

This version

0.1.0.post2

Dec 5, 2023

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Uploaded Dec 5, 2023 Source

Uploaded Dec 5, 2023 Python 3

Hashes for dijkstra-tg-0.1.0.post2.tar.gz
Algorithm	Hash digest
SHA256	`f51977799ad9f328c8205e32bfef449ae5e4dabd6f395309fe2f288c95dc177b`
MD5	`f7713c285900557cba63c9c85026da9a`
BLAKE2b-256	`2dfd896bfba360fdd6760086f37368adfe52718a7257dd78392442426928f704`

Hashes for dijkstra_tg-0.1.0.post2-py3-none-any.whl
Algorithm	Hash digest
SHA256	`89adbb3af3291a741042197c7ecc9d0ef93f263a9ea0686299644cad85c63ead`
MD5	`81611b5f6fceac18e34e57da242b0dbe`
BLAKE2b-256	`ee715409128bcbe1ff7000435033c43557abd7fe62cacbddc8dfe9c05cab1e40`