summaryrefslogtreecommitdiff
path: root/networkx/classes
Commit message (Expand)AuthorAgeFilesLines
* Update classes docMridul Seth2015-07-294-38/+69
* Quick doc fixesMridul Seth2015-07-141-3/+3
* Merge pull request #1638 from MridulS/adjiterDan Schult2015-07-037-54/+21
|\
| * Update adjacency_iter() method to adjacency() and remove adjacency_list()Mridul Seth2015-07-037-54/+21
* | Merge pull request #1634 from MridulS/selfloopsDan Schult2015-07-034-33/+33
|\ \
| * | Update G.number_of_selfloops()Mridul Seth2015-07-031-1/+1
| * | Make selfloop methods return iterator instead of list in MultiGraph classMridul Seth2015-07-022-18/+18
| * | Make selfloop methods return iterator instead of list in graph classMridul Seth2015-07-022-15/+15
| |/
* | Updates to degree methodMridul Seth2015-07-032-16/+21
* | Add comment about single node test in degree methodMridul Seth2015-07-034-2/+28
|/
* Remove commented out codeMridul Seth2015-06-271-88/+0
* Remove degree_iter(),now degree() returns an integer for single node and iter...Mridul Seth2015-06-2711-374/+321
* Add new degree() implementation to graph.pyMridul Seth2015-06-191-79/+102
* Merge pull request #1589 from MridulS/succprediterDan Schult2015-06-175-49/+33
|\
| * Update changes to G.successors()Mridul Seth2015-06-161-3/+0
| * Remove successors_iter() and predecessors_iter(). G.successors() and G.predec...Mridul Seth2015-06-125-48/+35
* | Merge pull request #1588 from MridulS/neigbhorsiterDan Schult2015-06-174-29/+9
|\ \
| * | Remove neighbors_iter, G.neighbors() now returns an iterator instead of listMridul Seth2015-06-124-29/+9
| |/
* | Solve merge conflictsMridul Seth2015-06-172-12/+11
* | Skip doctests for timingclasses.pyMridul Seth2015-06-171-0/+6
* | Revert changes in timingclasses.pyMridul Seth2015-06-171-58/+204
* | Remove edges_iter, G.edges() now returns an iterator instead of listMridul Seth2015-06-1711-526/+189
* | Merge remote-tracking branch 'upstream/iter_refactor' into iter_refactorMridul Seth2015-06-1710-132/+106
|\ \
| * | Update changes to G.nodes()Mridul Seth2015-06-163-20/+12
| * | Fix TODO in networkx/classes/graph.pyMridul Seth2015-06-131-2/+0
| * | Makes Graph.nodes() return iterator instead of listJeffrey Finkelstein2015-06-1110-131/+115
| |/
* | remove python2-ism introduced by mistakeDan Schult2015-06-161-1/+1
* | Fix big for iterator input for digraph.degreeDan Schult2015-06-164-12/+23
* | Minor docstring fixes.chebee7i2015-06-152-3/+3
* | "Warning" is not a numpydoc sectionAric Hagberg2015-06-133-12/+6
* | Spelling fixesAric Hagberg2015-06-131-3/+1
|/
* Merge branch 'master' of github.com:networkx/networkxchebee7i2015-04-291-6/+5
|\
| * Speed up non_edges for dense and complete graphsRaf Guns2015-04-281-2/+4
| * Simplify and speed up nx.non_edgesRaf Guns2015-04-281-6/+3
* | Simplify content of is_empty() functionThodoris Sotiropoulos2015-04-291-4/+2
* | Fix doc example errorsThodoris Sotiropoulos2015-04-291-2/+2
* | Add is_empty() and update is_weighted() to cover empty graph.chebee7i2015-04-292-0/+39
* | Rename to is_negatively_weighted, minor docstring edits.chebee7i2015-04-292-56/+77
* | Remove unnecessary elseThodoris Sotiropoulos2015-04-281-2/+1
* | Code simplificationThodoris Sotiropoulos2015-04-281-8/+2
* | Simplify return statement and remove variableThodoris Sotiropoulos2015-04-281-6/+2
* | Some code fixesThodoris Sotiropoulos2015-04-272-22/+20
* | Merge branch 'master' into checking-weightsThodoris Sotiropoulos2015-04-222-2/+2
|\ \ | |/
| * Fix copyrightsJGab2015-04-212-2/+2
* | Merge branch 'checking-weights' of https://github.com/Overriders/networkx int...Konstantinos Karakatsanis2015-04-161-1/+1
|\ \
| * | Fix typo error.Thodoris Sotiropoulos2015-04-161-1/+1
* | | Add useful return statementKonstantinos Karakatsanis2015-04-161-1/+1
* | | Fix typo errorKonstantinos Karakatsanis2015-04-161-1/+1
|/ /
* | Simplify code and remove unnecessary call of weighted_edges functionKonstantinos Karakatsanis2015-04-161-4/+3
* | Style changesKonstantinos Karakatsanis2015-04-162-2/+1