# dijkstra-simple: A simpler Dijkstra shortest paths implementation

Provides a simplistic Dijkstra implementation with some useful variations and generalizations.

[Skip to Readme]

Versions [faq] | 0.1.0 |
---|---|

Change log | changelog.md |

Dependencies | base (>=4.7 && <5), containers (>=0.6.2.1 && <0.7), fingertree (>=0.1.4.0 && <0.1.5) [details] |

License | BSD-3-Clause |

Copyright | Gautier DI FOLCO |

Author | Gautier DI FOLCO |

Maintainer | gautier.difolco@gmail.com |

Category | graph, dijkstra |

Home page | https://github.com/blackheaven/dijkstra-simple#readme |

Bug tracker | https://github.com/blackheaven/dijkstra-simple/issues |

Source repo | head: git clone https://github.com/blackheaven/dijkstra-simple |

Uploaded | by gdifolco at 2020-06-27T14:35:06Z |

Distributions | |

Downloads | 38 total (9 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2020-06-27 [all 1 reports] |

## Downloads

- dijkstra-simple-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)