0.1.2

Bug Fixes

• Fix non-deterministic SPQR decomposition caused by Python hash seed
  randomization. PathSearcher picked the DFS start vertex via
  next(iter(set)), whose iteration order varies with
  PYTHONHASHSEED. This produced different triconnected components
  (~50% of runs) for the same input graph. Now uses a deterministic
  start vertex derived from edge insertion order.

0.1.1

Bug Fixes

• find_triconnected_components() now raises ValueError when the
  input graph is not biconnected (disconnected or has a cut vertex).
  Previously, non-biconnected input was silently accepted and produced
  incorrect results.

Documentation

• Use public API imports (from spqrtree import MultiGraph) in
  documentation examples instead of internal modules.

0.1.0

Initial release.