Skip to content

Latest commit

 

History

History
31 lines (23 loc) · 740 Bytes

CHANGELOG.md

File metadata and controls

31 lines (23 loc) · 740 Bytes

Changelog

[v0.4.0] - 2023-4-6

Added

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

[v0.3.0] - 2023-3-16

Added

  • 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] - 2023-3-8

Added

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

[v0.1.0] - 2023-3-1

Added

  • Introduce core datastructures
  • Introduce base traversal iterators