0.6.0 - 2023-04-29
- Perform chunk copies in
IntDequeue.toIntArray()
. - Support contracts in graph builders.
0.5.0 - 2023-04-28
- Add Prim's minimum spanning tree algorithm.
- Add overloads to
forEachNeighbor
,forEachArc
andforEachEdge
with weights.
- 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
- Remove some references to
Vertex.index
from multiple algorithms.
0.4.0 - 2023-04-27
- Add Dijkstra's shortest path algorithm.
0.3.1 - 2023-04-26
- Make int packing functions non-inline.
0.3.0 - 2023-04-26
- Add a topological sort algorithm.
- Add
Array<Vertex>.toVertexArray()
andVertexArray.toTypedArray()
extension methods.
0.2.0 - 2023-04-25
- Moved algorithms to the
io.github.alexandrepiveteau.graphs.algorithms
package. - Added scope and dedicated builder interfaces to graph builders.
0.1.1 - 2023-04-25
- Added some download instructions.
0.1.0 - 2023-04-25
Initial release