summaryrefslogtreecommitdiff
path: root/networkx/algorithms/tests/test_dag.py
Commit message (Expand)AuthorAgeFilesLines
* Fix weighted MultiDiGraphs in DAG longest path algorithms + add additional te...stevenstrickler2022-10-251-0/+42
* [ENH] Find and verify a minimal D-separating set in DAG (#5898)Adam Li2022-08-231-0/+19
* Use isort with pre-commit to enforce import guidelines (#5659)Mridul Seth2022-06-021-1/+2
* Add regression test for ancestors/descedants w/ undir. G. (#5188)Ross Barnowski2021-11-221-0/+7
* Refactor `transitive_closure` (#5052)Vadim2021-09-171-1/+39
* Style changes (#5022)Dan Schult2021-08-141-9/+1
* Refactor testing utilities (#4829)Jarrod Millman2021-05-261-21/+20
* Add topological_generations function (#4757)as13712021-05-191-0/+34
* Deprecate utils.misc.consume (#4449)Jarrod Millman2020-12-121-6/+12
* Format w/ blackJarrod Millman2020-07-101-56/+99
* Upgrade to Py36 syntaxJarrod Millman2020-01-011-8/+8
* PEP8 fixes to testsJarrod Millman2019-10-181-10/+10
* Remove old Python 2 codeJarrod Millman2019-10-181-18/+2
* Replace eq_, ok_ with assertJarrod Millman2019-10-121-2/+1
* Replace nose.raises with pytest.raises context managerJarrod Millman2019-10-121-10/+9
* Replace nose.assert_raises with pytest.raisesJarrod Millman2019-10-121-21/+21
* Remove unused importsJarrod Millman2019-10-121-5/+0
* Convert nose.tools.assert_* functions into assertsJarrod Millman2019-10-121-60/+60
* Use class methods for class setup/teardownStefan van der Walt2019-10-121-1/+2
* Fixes #3187 transitive_closure now returns self-loops when cycles present (#...Dan Schult2019-10-011-6/+34
* Faster transitive closure computation for DAGs (#3445)Anthony Labarre2019-08-091-0/+23
* Fixes Issue #3493 - Bug in lexicographical_topological_sort() (#3494)Subhendu Ranajn Mishra2019-06-291-4/+33
* Enumerate all topological sorts of a digraph (#3049)aweltsch2018-07-091-1/+55
* Pep8 fixesJarrod Millman2018-01-201-1/+2
* Adds prefix_tree, dag_to_branching, and example. (#2784)Dan Schult2017-12-021-5/+97
* Copy graph in transitive closure algorithm. (#2718)aweltsch2017-10-221-0/+12
* Fix dag_longest_path bug (#2703)Ariel Chinn2017-10-161-0/+4
* Comply with pep8Jarrod Millman2017-08-171-7/+7
* Fix test ordering issues for python3.6Aric Hagberg2017-04-021-2/+3
* Merge pull request #2215 from JamesClough/transitive_reductionDan Schult2016-09-101-0/+12
|\
| * Add transitive_reductionJames Clough2016-08-241-0/+12
* | have dag_longest_path_length return path length, not edge countChris Morin2016-08-301-1/+7
* | test_unorderable_nodes doesn't catch all cases where nodes are unorderableChris Morin2016-08-231-18/+19
|/
* Adds unorderable nodes test for dag_longest_path.Jeffrey Finkelstein2016-02-201-42/+93
* Change all X.add_path yp nx.add_path(X,Dan Schult2016-02-021-10/+10
* Fixed old tests and re-added them.Neil2015-08-311-3/+16
* topolgical_sort, lexicographical_topological_sortNeil2015-08-311-49/+65
* dag_longest_path: Use edge weightsShaun Jackman2015-06-301-0/+8
* Update algorithms/dag.py and algorithms/tests/test_dag.py to be PEP8 complaintMridul Seth2015-04-251-65/+80
* Added longest_path and longest_path_length for DAGMridul Seth2015-04-251-0/+18
* Update transitive_clousure and antichainsMridul Seth2015-03-211-19/+23
* Expose transitive_clousure and antichains in the public APIMridul Seth2015-03-191-0/+41
* Fix unreliable tests uncovered by IronPythonysitu2014-07-031-8/+12
* MAINT: use reverse=True for some topological_sort callsalex2014-02-181-0/+16
* is_directed_acyclic_graph now returns false on undirected graphs rather than ...Alex Roper2013-07-131-0/+7
* Refactor functions to use faster nx.shortest_path_lengthJuan Nunez-Iglesias2012-12-121-4/+0
* Improve performance of descendants and ancestorsJuan Nunez-Iglesias2012-11-221-2/+2
* Add ancestor and descendant functions for DAGsJuan Nunez-Iglesias2012-11-131-0/+24
* Adds is_aperiodicBen Edwards2011-06-241-0/+60
* Add tests based on comments in ticket 559Dan Schult2011-05-271-1/+10
View Lorry Controller Status