summaryrefslogtreecommitdiff
path: root/networkx/classes/digraph.py
Commit message (Expand)AuthorAgeFilesLines
* Fix some sphinx formatting errorsDan Schult2015-10-041-2/+3
* minor changes related to _iter removalDan Schult2015-08-071-15/+15
* Update classes docMridul Seth2015-07-291-10/+21
* Merge pull request #1638 from MridulS/adjiterDan Schult2015-07-031-4/+4
|\
| * Update adjacency_iter() method to adjacency() and remove adjacency_list()Mridul Seth2015-07-031-4/+4
* | Updates to degree methodMridul Seth2015-07-031-8/+10
* | Add comment about single node test in degree methodMridul Seth2015-07-031-0/+9
|/
* Remove degree_iter(),now degree() returns an integer for single node and iter...Mridul Seth2015-06-271-115/+69
* Merge pull request #1589 from MridulS/succprediterDan Schult2015-06-171-16/+3
|\
| * Remove successors_iter() and predecessors_iter(). G.successors() and G.predec...Mridul Seth2015-06-121-16/+3
* | Remove edges_iter, G.edges() now returns an iterator instead of listMridul Seth2015-06-171-29/+19
* | Merge remote-tracking branch 'upstream/iter_refactor' into iter_refactorMridul Seth2015-06-171-8/+8
|\ \
| * | Makes Graph.nodes() return iterator instead of listJeffrey Finkelstein2015-06-111-8/+8
| |/
* | remove python2-ism introduced by mistakeDan Schult2015-06-161-1/+1
* | Fix big for iterator input for digraph.degreeDan Schult2015-06-161-6/+4
* | "Warning" is not a numpydoc sectionAric Hagberg2015-06-131-4/+2
|/
* Expand data keyword in G.edges and add default dataDan Schult2015-01-171-10/+23
* Address ironpython issues from #1327Dan Schult2015-01-091-8/+9
* Meld special classes with base classes.Dan Schult2015-01-021-27/+116
* Make add_nodes_from compatible with IronPythonysitu2014-07-031-18/+16
* clarified edge attribute update precedence in add_edges_from()Arne Neumann2014-04-121-0/+3
* Fix/adjust/remove/modify tests that depend on dictionary ordering.Aric Hagberg2012-07-081-3/+0
* Adjust graph/digraph/multigraph/multidgraph node attribute example so it does...Aric Hagberg2012-06-231-1/+2
* Add comment about edges() v out_edges().Aric Hagberg2012-04-081-0/+1
* Change node lookups to G.node instead of G.adjDan Schult2012-02-051-4/+4
* Remove spurious iter() and iter(dict.keys()) calls due to 2to3.Dan Schult2011-06-181-6/+6
* Remove weight is False or True backward compatibility in degree methods.Dan Schult2011-06-181-4/+2
* Change degree() and friends to accept weight= keyword instead of weighted=Dan Schult2011-06-181-36/+53
* DiGraph and MultiDigraph reverse(copy=True) methods don't make a proper copy ...Aric Hagberg2011-06-091-5/+5
* Remove deprecated "from_whatever()" in favor of to_networkx_graph().Aric Hagberg2011-06-041-12/+7
* Make Graph.name a property that sets/gets Graph.graph['name']Aric Hagberg2011-05-161-5/+1
* Add graph attribute 'name'.Aric Hagberg2011-04-161-3/+2
* Remove statements that do nothing.Loïc Séguin-C.2011-02-111-2/+1
* Add reciprocal option in to_undirected().Aric Hagberg2010-09-281-5/+16
* Remove iteritems 2ism and add test.aric2010-08-071-2/+2
* Merging py3k-1.2 branch into trunk. Addresses #348loicseguin2010-08-021-35/+41
* Move from list comprehensions to generator expressions where appropriate.dschult2010-05-051-11/+8
* Remove annoying white space at end of line...dschult2010-05-041-109/+109
* Remove the now unused copy=True argument from the subgraph methods.dschult2010-04-181-1/+1
* Use standard "import networkx as nx" in all modulesaric2010-04-171-0/+1
* Remove with_labels keyword from *degree() methods.aric2010-04-151-30/+19
* Improve subgraph documentation about attributes anddschult2010-04-141-3/+3
* Revert "view" testing - now moved to brancharic2010-04-141-118/+1
* I'm committing an attempt to give the base classes a methoddschult2010-04-131-1/+118
* Spelling enhancementsaric2010-04-071-1/+1
* Use to_networkx_graph() instead of from_whatever()aric2010-04-071-4/+2
* Add more documentation on shallow and deep copiesaric2010-04-061-6/+19
* Allow add_nodes_from to accept (node,attrdict) 2-tuple pairs.dschult2010-03-251-6/+35
* Fix subgraph copy of node attributes indschult2010-03-111-1/+2
* Change subgraph to create a copy of the connectivitydschult2010-03-051-65/+40