Release v0.7.0

Partition algorithms are added to the partition package:

• Girvan-Newman community detection algorithm for undirected graphs.
• Approximate k-cut of an undirected graph using a randomized contraction algorithm (generalization of Karger’s min-cut).
• Bron–Kerbosch algorithm with pivot selection, degeneracy ordering, and bitsets to find all maximal cliques.

Release v0.6.0

• Add transitive reduction algorithm

Release v0.5.0

• Upgrade go version to v1.24.2
• Cleanup code and run fmt
• Upgrade golangci config file

Release v0.4.1

• Fix add edge and new nodes to a cyclic graph.

v0.4.0 Release

• Added "path package"
• Added "simple Dijkstra's algorithm"
• Added "standard Dijkstra's algorithm"

v0.3.0 Release

• Added "connectivity package"
• Added "Trajan's algorithm implementation to find Strongly Connected Components(SCCs) in a graph"
• Added "Kosaraju's algorithm implementation to find SCCs in a graph"
• Added "Gabow's algorithm implementation to find SCCs in a graph"

v0.2.0 Release

• Added "Traverse package doc"
• Added "Closes-first iterator"
• Added "Random walk iterator"
• Added "Edge method to expose total degree"
• Added " Edge methods to expose source and destination vertices"

v0.1.0 Release

• Introduce core data structures
• Introduce base traversal iterators