Qiskit / rustworkx / 5813757295

94%

push

github

Adding Transitive Reduction Function (#923)

* Implementing filter_nodes and filter_edges funcs

* Running fmt and clippy

* Fixed issue where errors were not being propagated up to Python. Created tests for filter_edges and filter_nodes for both PyGraph and PyDiGraph. Created release notes for the functions.

* Ran fmt, clippy, and tox

* Fixing release notes

* Fixing release notes again

* Fixing release notes again again

* Fixed release notes

* Fixed release notes. Changed Vec allocation. Expanded on documentation.

* ran cargo fmt and clippy

* working on adding different parallel edge behavior

* Fixing docs for filter functions

* Working on graph_adjacency_matrix

* Implementing changes to graph_adjacency_matrix and digraph_adjacency_matrix

* working on release notes

* Fixed release notes and docs

* Ran cargo fmt

* Ran cargo clippy

* Fixed digraph_adjacency_matrix, passes tests

* Removed mpl_draw from r
elease notes

* Changed if-else blocks in adjacency_matrix functions to match blocks. Wrote tests.

* Fixed tests to pass lint

* Added transitive reduction function to dag algo module

* Fixed issue with graph that have nodes removed. Function now returns index_map for cases where there were nodes removed. Added tests.

* Changing graph.nodes_removed to be false again. Return graph does not have removed nodes

* Adding requested changes:
- Fixing Docs
- Fixing Maps to only have capacity of node_count
- Fixing tests

* Adding function to DAG algorithsm index

65 of 65 new or added lines in 2 files covered. (100.0%)

15378 of 15940 relevant lines covered (96.47%)

2539354.96 hits per line