Releases: matiii/Dijkstra.NET
Releases · matiii/Dijkstra.NET
1.2.1
Features
- Simple graph implementation, without custom informations in node and edge.
- Get edges from node in complex graph.
1.2.0
Features
- PageRank implementation.
- Refinement of graph model.
Breaking changes
- Key of node starts from 1 instead of 0
1.1.0
Implementation of depth in Dijkstra algorithm.
1.0.9
Immutable graph. Any algorithm should not mutate state of graph.
Take advantage of structures in C# 7.3
1.0.6
Add bfs parallel version of the shortest path algorithm.
Fix bug, update pirority queue when node distance has been updated.