Skip to content

CLRS 1.0.0

Choose a tag to compare

@bibarzgoogle bibarzgoogle released this 01 Jun 16:07
· 80 commits to master since this release

Main changes

  • Extended the benchmark from 21 to 30 tasks by adding the following:
    • Activity selection (Gavril, 1972)
    • Longest common subsequence
    • Articulation points
    • Bridges
    • Kosaraju's strongly connected components algorithm (Aho et al., 1974)
    • Kruskal's minimum spanning tree algorithm (Kruskal, 1956)
    • Segment intersection
    • Graham scan convex hull algorithm (Graham, 1972)
    • Jarvis' march convex hull algorithm (Jarvis, 1973)
  • Added new baseline processors:
    • Deep Sets (Zaheer et al., NIPS 2017) and Pointer Graph Networks (Veličković et al., NeurIPS 2020) as particularisations of the existing Message-Passing Neural Network processor.
    • End-to-End Memory Networks (Sukhbaatar et al., NIPS 2015)
    • Graph Attention Networks v2 (Brody et al., ICLR 2022)

Detailed changes

Full Changelog: v0.0.2...v1.0.0