Releases: alexandrepiveteau/kotlin-graphs
Releases · alexandrepiveteau/kotlin-graphs
0.6.1
0.6.0
Improvements
- Perform chunk copies in
IntDequeue.toIntArray()
. - Support contracts in graph builders.
0.5.0
Algorithms
- Add Prim's minimum spanning tree algorithm.
- Add overloads to
forEachNeighbor
,forEachArc
andforEachEdge
with weights.
API Changes
- Introduce a bunch of interfaces to model mutable graphs.
- Added
MutableGraph
,MutableNetwork
and directed/undirected variants. - Renamed
GraphBuilderScope
and variants toMutableGraphScope
, which is implemented by the newMutableGraph
interface.
- Added
Bug fixes
- Remove some references to
Vertex.index
from multiple algorithms.
0.4.0
Algorithms
- Add Dijkstra's shortest path algorithm.
0.3.1
Fixes
- Make int packing functions non-inline.
0.3.0
Algorithms
- Add a topological sort algorithm.
API Changes
- Add
Array<Vertex>.toVertexArray()
andVertexArray.toTypedArray()
extension methods.
0.2.0
- Moved algorithms to the
io.github.alexandrepiveteau.graphs.algorithms
package. - Added scope and dedicated builder interfaces to graph builders.