{"library":"dijkstar","type":"library","category":null,"description":"Dijkstar is an implementation of Dijkstra's single-source shortest paths algorithm and the A* algorithm for weighted multigraphs. Current version 2.6.0 (release frequency: occasional). It is simple to use and allows custom graph structures.","language":"python","status":"active","version":"2.6.0","tags":["dijkstra","a-star","shortest-path","graph","algorithm"],"last_verified":"Fri May 01","install":[{"cmd":"pip install dijkstar","imports":["from dijkstar import Graph","from dijkstar import find_path"]}],"homepage":null,"github":"https://github.com/wylee/Dijkstar","docs":null,"changelog":null,"pypi":"https://pypi.org/project/dijkstar/","npm":null,"openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}