summaryrefslogtreecommitdiff
path: root/networkx
Commit message (Collapse)AuthorAgeFilesLines
* networkx-1.4 release updatenetworkx-1.4Aric Hagberg2011-01-231-1/+1
|
* Add read_edgelist example that shows edge data formattingAric Hagberg2011-01-181-1/+11
|
* Switch back to dev release taggingAric Hagberg2011-01-171-2/+2
|
* networkx-1.4rc1 release candidateAric Hagberg2011-01-161-0/+1
|
* Rename release variable.networkx-1.4rc1Aric Hagberg2011-01-161-2/+3
|
* Document shortest paths for dense graphsAric Hagberg2011-01-161-131/+2
|
* Don't warn on multiple matplotlib.use() calls.Aric Hagberg2011-01-162-2/+2
|
* Doc fixes.Aric Hagberg2011-01-165-59/+47
|
* Fix Sphinx doc issues.Aric Hagberg2011-01-162-17/+11
|
* Change names to avoid conflictsAric Hagberg2011-01-162-77/+1
|
* Yields->Returns for Sphinx docsAric Hagberg2011-01-164-8/+8
|
* Change nameAric Hagberg2011-01-162-1/+75
| | | | | --HG-- rename : networkx/algorithms/isolates.py => networkx/algorithms/isolate.py
* Rename nlist->nodes in methods where nodes is now a container.Aric Hagberg2011-01-151-11/+11
|
* Graph.add_star(), Graph.add_cycle() and Graph.add_path() now accept any ↵Loïc Séguin-C.2011-01-152-8/+11
| | | | iterable object as a node list.
* In Python 3, range() is a generator thus it can't be passed to ↵Loïc Séguin-C.2011-01-151-2/+2
| | | | Graph.add_cycle() and Graph.add_path().
* Merge commitAric Hagberg2011-01-153-64/+124
|\
| * Bug in create_using.Aric Hagberg2011-01-151-3/+6
| | | | | | | | Bug in number of possible directed edges.
| * Some tests for random graphs.Aric Hagberg2011-01-151-0/+64
| |
| * Remove create_using arguments in gnp,gnm random graph generators in favor of ↵Aric Hagberg2011-01-151-61/+43
| | | | | | | | | | | | explicit directed=True|False. If you want a multigraph you can use G=nx.MultiGraph(nx.gnp_random_graph(n,p))
| * Rename the networkx multigraph 'key' to 'networkx_key' when reading/writing GEXFAric Hagberg2011-01-151-1/+12
| | | | | | | | | | | | so it can be used an an attribute. Addresses #483
* | Add rich club coefficientAric Hagberg2011-01-152-27/+40
| |
* | Add import for richclubAric Hagberg2011-01-141-0/+2
| |
* | Use nx.utils version of cumulative_sumAric Hagberg2011-01-141-6/+1
| | | | | | | | | | --HG-- extra : rebase_source : 1ef0e0c0d6c43037373b4ce2968c003bff6f3c6f
* | Add rich club metric. Addresses #356Aric Hagberg2010-09-282-0/+123
|/ | | | | --HG-- extra : rebase_source : e8e2f4d71c58a3df6399fec50c67136d85cfc4c7
* Merge commit.Aric Hagberg2011-01-132-6/+96
|\
| * Add generate_graphml() option.Aric Hagberg2011-01-131-3/+44
| | | | | | | | | | Similar to generate_gexf(). Closes #489
| * Update docstring.Aric Hagberg2011-01-131-3/+0
| | | | | | | | Address #489
| * Add string option with generate_gexf()Aric Hagberg2011-01-131-3/+55
| | | | | | | | Addresses #489
* | Add patch by Jesus Cerquides to correct powerlaw_cluster_graph.Dan Schult2011-01-132-6/+19
| | | | | | | | Fixes #487
* | Change node_clique_number to use create ego_graph for eachDan Schult2011-01-122-3/+23
|/ | | | | | | | | node before finding cliques when nodes argument is specified. No easy way to tell whether ego_graph method will work faster in general. We can open this again if we see a way to do that. Fixes #479
* Raise error for average shortest path if graph is not (weakly) connected.Aric Hagberg2010-12-142-12/+50
| | | | Addresses #478
* Use maxsize instead of maxint.Aric Hagberg2010-12-121-2/+2
| | | | Addresses #417
* Fixed NetworkXErrorJesus Cerquides2010-12-122-5/+6
|
* maxint instead of maxsizeJesus Cerquides2010-12-121-3/+3
|
* Return only node set in find_induced_nodes()Aric Hagberg2010-12-122-11/+5
|
* Documentation updates including rst template for sphinx and formatting tweaks.Aric Hagberg2010-12-123-88/+86
| | | | | | | | | | | | | Change None to -1 in two places to avoid None comparison with integer. Change file name to chordal_alg.py to avoid name clash. Change algorithm name to find_induced_nodes() sys.maxint->sys.maxsize --HG-- rename : networkx/algorithms/chordal/chordal.py => networkx/algorithms/chordal/chordal_alg.py
* Merge commit: chordalAric Hagberg2010-12-124-1/+421
|\
| * Added checks for chordality. Created specific exceptions. Improved ↵Jesus Cerquides2010-12-122-42/+226
| | | | | | | | documentationç
| * Removed approximationJesus Cerquides2010-12-011-1/+1
| |
| * Removed approximationJesus Cerquides2010-12-012-163/+0
| |
| * First changeset added to the forkJesus Cerquides2010-12-016-1/+400
| |
* | Use sequential edge id counter instead of NetworkX key.Aric Hagberg2010-12-111-9/+10
| | | | | | | | Fixes #483
* | Handle testing with no DISPLAY environment.Aric Hagberg2010-12-112-4/+4
|/ | | | Fixes #432
* Quote string node labels in GML writer.Aric Hagberg2010-11-291-1/+3
| | | | Addresses #476
* Start edge key search at len(keydict) instead of 0 to save time with many ↵Dan Schult2010-11-292-3/+3
| | | | | | | multiedges. --HG-- extra : rebase_source : 67b261bf1d622af0e14f6e9787acbc5b052db253
* Fix iterator version of complete_graph when n<2.Dan Schult2010-11-291-5/+6
| | | | | --HG-- extra : rebase_source : 82691d2ce30fc9f2179ec467a5b05cf3e976958e
* Read and write graph data with GraphML.Aric Hagberg2010-11-291-11/+19
| | | | Addresses #480
* Remove double quotes in test.Aric Hagberg2010-11-291-11/+11
| | | | Addresses #476
* Strip double quotes.Aric Hagberg2010-11-291-0/+1
| | | | Addresses #476
* Add graph attributes when parsing GML.Aric Hagberg2010-11-291-0/+2
| | | | Addresses #480
View Lorry Controller Status