Skip to content
This repository was archived by the owner on Jun 18, 2026. It is now read-only.

v2.43.0 — Chordal Graph & DijkstraEntry Refactor

Choose a tag to compare

@sauravbhattacharya001 sauravbhattacharya001 released this 16 Apr 16:22
· 191 commits to master since this release

What's Changed

Refactoring

  • Chordal graph: Eliminated redundant adjacency map construction in the public API — the chordal-check methods now reuse the existing internal adjacency structure instead of rebuilding it on every call
  • DijkstraEntry deduplication: Consolidated the duplicated \DijkstraEntry\ inner class between \GraphUtils\ and \ShortestPathFinder\ into a single shared implementation, reducing maintenance surface and ensuring consistent priority-queue behavior

Full Changelog: v2.42.0...v2.43.0