29438748013
95%
main: 95%

Ran 15 Jul 2026 06:13PM UTC

Jobs 1

Files 118

Run time 1min

Badge

Embed ▾

Committed 15 Jul 2026 05:59PM UTC coverage: 94.696%. Remained the same

Build # 29438748013

Build Type

push

github

Committed by

web-flow

Commit Message

Return neighbors in a deterministic order (#1638)

* Return neighbors in a deterministic order

PyGraph.neighbors, PyDiGraph.neighbors and PyDiGraph.neighbors_undirected
deduplicated their results through a HashSet and returned them via
`drain()`. The HashSet iteration order is randomized, so the order of the
returned node indices could change between runs and even between calls.

Deduplicate while preserving the graph's edge iteration order by filtering
through a `seen` set instead of draining a HashSet. This keeps the
multigraph deduplication behaviour but makes the ordering stable.

Also update the now-deterministic neighbors_undirected docstring example
and add regression tests asserting a stable order and correct dedup.

Fixes #1501

* Use IndexSet for deterministic ordering

---------

Co-authored-by: Ivan Carvalho <ivancarvalho@gatech.edu>

Coverage Stats

19230 of 20307 relevant lines covered (94.7%)

914183.47 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	29438748013.1	15 Jul 2026 06:13PM UTC	118	94.7	GitHub Action Run

Qiskit / rustworkx / 29438748013
95%
main: 95%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 29438748013

Qiskit / rustworkx / 29438748013 95% main: 95%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 29438748013

Qiskit / rustworkx / 29438748013
95%
main: 95%

README BADGES
x