Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Merge pull request #1677 from MridulS/docupiter_refactor | Dan Schult | 2015-07-29 | 4 | -38/+69 |
|\ | | | | | Update classes docs | ||||
| * | Update classes doc | Mridul Seth | 2015-07-29 | 4 | -38/+69 |
|/ | |||||
* | Merge pull request #1665 from MridulS/docupdate | Aric Hagberg | 2015-07-19 | 5 | -23/+7 |
|\ | | | | | Doc fixes in iter_refactor branch | ||||
| * | Update doc/source/reference | Mridul Seth | 2015-07-14 | 4 | -20/+4 |
| | | |||||
| * | Quick doc fixes | Mridul Seth | 2015-07-14 | 1 | -3/+3 |
|/ | |||||
* | Merge pull request #1638 from MridulS/adjiter | Dan Schult | 2015-07-03 | 18 | -73/+40 |
|\ | | | | | Update adjacency_iter() method to adjacency() and remove adjacency_list() | ||||
| * | Update adjacency_iter() method to adjacency() and remove adjacency_list() | Mridul Seth | 2015-07-03 | 18 | -73/+40 |
| | | |||||
* | | Merge pull request #1634 from MridulS/selfloops | Dan Schult | 2015-07-03 | 6 | -35/+35 |
|\ \ | | | | | | | Make selfloop methods return iterator instead of list in graph class | ||||
| * | | Update G.number_of_selfloops() | Mridul Seth | 2015-07-03 | 1 | -1/+1 |
| | | | |||||
| * | | Make selfloop methods return iterator instead of list in MultiGraph class | Mridul Seth | 2015-07-02 | 2 | -18/+18 |
| | | | |||||
| * | | Make selfloop methods return iterator instead of list in graph class | Mridul Seth | 2015-07-02 | 4 | -17/+17 |
| |/ | |||||
* | | Merge pull request #1636 from MridulS/degreeupdate | Dan Schult | 2015-07-03 | 4 | -14/+45 |
|\ \ | |/ |/| | Add comment about single node test in degree method | ||||
| * | Updates to degree method | Mridul Seth | 2015-07-03 | 2 | -16/+21 |
| | | |||||
| * | Add comment about single node test in degree method | Mridul Seth | 2015-07-03 | 4 | -2/+28 |
|/ | |||||
* | Merge pull request #1633 from MridulS/examples | Dan Schult | 2015-07-02 | 4 | -39/+6 |
|\ | | | | | Update examples directory | ||||
| * | Update examples directory | Mridul Seth | 2015-07-01 | 4 | -39/+6 |
| | | |||||
* | | Merge pull request #1617 from MridulS/degreeiter | Dan Schult | 2015-07-02 | 50 | -650/+517 |
|\ \ | |/ |/| | Remove degree_iter(),now degree() returns an integer for single node and iterator for else | ||||
| * | Update networkx/generators/directed.py and connectivity/node_connectivity.py | Mridul Seth | 2015-06-29 | 2 | -17/+15 |
| | | |||||
| * | Quick fixes | Mridul Seth | 2015-06-28 | 5 | -13/+13 |
| | | |||||
| * | Remove commented out code | Mridul Seth | 2015-06-27 | 2 | -124/+6 |
| | | |||||
| * | Solve merge conflict | Mridul Seth | 2015-06-27 | 0 | -0/+0 |
| |\ | |/ |/| | |||||
* | | Merge pull request #1615 from MridulS/connectivity | chebee7i | 2015-06-19 | 1 | -1/+1 |
|\ \ | | | | | | | Update assortativity/connectivity.py, target_degree to take in iterator instead of list | ||||
| * | | Update assortativity/connectivity.py, target_degree to take in iterator ↵ | Mridul Seth | 2015-06-17 | 1 | -1/+1 |
|/ / | | | | | | | instead of list | ||||
| * | Remove degree_iter(),now degree() returns an integer for single node and ↵ | Mridul Seth | 2015-06-27 | 50 | -584/+548 |
| | | | | | | | | iterator for else | ||||
| * | Update assortativity/connectivity.py, target_degree to take in iterator ↵ | Mridul Seth | 2015-06-20 | 1 | -1/+1 |
| | | | | | | | | instead of list | ||||
| * | Add new degree() implementation to graph.py | Mridul Seth | 2015-06-19 | 1 | -79/+102 |
|/ | |||||
* | Merge pull request #1589 from MridulS/succprediter | Dan Schult | 2015-06-17 | 18 | -75/+59 |
|\ | | | | | Remove successors_iter() and predecessors_iter(). G.successors() and G.predecessors() now return iterators instead of lists | ||||
| * | Update changes to G.successors() | Mridul Seth | 2015-06-16 | 2 | -4/+1 |
| | | |||||
| * | Remove successors_iter() and predecessors_iter(). G.successors() and ↵ | Mridul Seth | 2015-06-12 | 18 | -74/+61 |
| | | | | | | | | G.predecessors() now return iterators instead of lists | ||||
* | | Merge pull request #1588 from MridulS/neigbhorsiter | Dan Schult | 2015-06-17 | 22 | -63/+37 |
|\ \ | | | | | | | Remove neighbors_iter, G.neighbors() now returns an iterator instead of list | ||||
| * | | Remove neighbors_iter, G.neighbors() now returns an iterator instead of list | Mridul Seth | 2015-06-12 | 22 | -63/+37 |
| |/ | |||||
* | | Merge pull request #1587 from MridulS/edgesiter | Dan Schult | 2015-06-17 | 124 | -1022/+879 |
|\ \ | | | | | | | Remove edges_iter, G.edges() now returns an iterator instead of list | ||||
| * | | Solve merge conflicts | Mridul Seth | 2015-06-17 | 9 | -22/+21 |
| | | | |||||
| * | | Update changes to G.edges() | Mridul Seth | 2015-06-17 | 2 | -1/+5 |
| | | | |||||
| * | | Skip doctests for timingclasses.py | Mridul Seth | 2015-06-17 | 1 | -0/+6 |
| | | | |||||
| * | | Revert changes in timingclasses.py | Mridul Seth | 2015-06-17 | 1 | -58/+204 |
| | | | |||||
| * | | Update and solve merge conflicts | Mridul Seth | 2015-06-17 | 1 | -1/+1 |
| | | | |||||
| * | | Remove edges_iter, G.edges() now returns an iterator instead of list | Mridul Seth | 2015-06-17 | 83 | -723/+378 |
| | | | |||||
| * | | Merge remote-tracking branch 'upstream/iter_refactor' into iter_refactor | Mridul Seth | 2015-06-17 | 87 | -462/+424 |
| |\ \ | |/ / |/| | | |||||
* | | | Merge pull request #1586 from MridulS/nodesiter | chebee7i | 2015-06-17 | 87 | -462/+424 |
|\ \ \ | |_|/ |/| | | Makes Graph.nodes() return iterator instead of list | ||||
| * | | Update changes to G.nodes() | Mridul Seth | 2015-06-16 | 6 | -22/+18 |
| | | | |||||
| * | | Fix TODO in networkx/classes/graph.py | Mridul Seth | 2015-06-13 | 1 | -2/+0 |
| | | | |||||
| * | | Update removal of nodes_iter() | Mridul Seth | 2015-06-12 | 3 | -5/+5 |
| | | | |||||
| * | | Makes Graph.nodes() return iterator instead of list | Jeffrey Finkelstein | 2015-06-11 | 84 | -456/+424 |
|/ / | | | | | | | | | | | | | Previously `Graph.nodes()` returned a list of nodes and `Graph.nodes_iter()` returned an iterator over nodes. With this commit, the former function now returns an iterator and the latter no longer exists. | ||||
| * | Merge pull request #1578 from jfinkels/approx-clique-max | chebee7i | 2015-06-17 | 2 | -5/+39 |
| |\ | | | | | | | Find maximum clique by cardinality. | ||||
| | * | Find maximum clique by cardinality. | Jeffrey Finkelstein | 2015-06-10 | 2 | -5/+39 |
| |/ |/| | | | | | | | | | Before, the maximum clique was chosen from a set of candidate cliques according to the subset ordering on sets. This commit changes the code to choose the maximum clique according to clique size. | ||||
| * | Merge pull request #1605 from SanketDG/paramfix | chebee7i | 2015-06-17 | 2 | -133/+127 |
| |\ | | | | | | | Docstring fix for adjlist and multiline_adjlist. | ||||
| | * | fix pep8, refactor code and use str.format | SanketDG | 2015-06-16 | 2 | -117/+127 |
| | | | |||||
| | * | remove repeated param create_using | SanketDG | 2015-06-16 | 2 | -16/+0 |
| | | | |||||
| * | | Merge pull request #1606 from MridulS/betweenness_subset | chebee7i | 2015-06-17 | 1 | -4/+9 |
| |\ \ | | | | | | | | | Update doc/source/reference/algorithms.centrality.rst |