summaryrefslogtreecommitdiff
Commit message (Expand)AuthorAgeFilesLines
* networkx-0.34 releasenetworkx-0.34aric2007-04-131-3/+3
* Update to News for networkx-0.34, fix typos in Tutorial and MailingListaric2007-04-133-10/+8
* clean up documentation for epydoc/rst parsingaric2007-04-132-54/+59
* Docstring changes reagrding nbunch. Many of thesedschult2007-04-125-77/+71
* Change nbunch treatment for edges() and degree() methods anddschult2007-04-129-50/+28
* Update downloads infoaric2007-04-121-15/+6
* mailing list infoaric2007-04-121-0/+71
* update News,Contributing,Creditsaric2007-04-123-48/+51
* Add is_isomorphic to __init__.pyaric2007-04-123-25/+18
* Adding date and revision to svn:keywordscellison2007-04-110-0/+0
* Adding tests for isomorphisms and specific tests for VF2 isomorphism algorithm.cellison2007-04-112-2/+78
* Adding VF2 isomorphism algorithm.cellison2007-04-112-0/+1012
* adjust mailing list links to googlegroupsaric2007-04-111-9/+30
* Add clique routines to __init__.py for auto importaric2007-04-111-1/+5
* benchmark output formattingaric2007-04-111-10/+19
* Better/more/correct benchmark examples.dschult2007-03-254-27/+143
* Add a benchmakr module which allows easy comparison of graph class speeddschult2007-03-242-0/+122
* documentation formattingaric2007-03-071-7/+8
* Clean up exception handling when no path exists.dschult2007-02-221-10/+9
* Add an error type to "raise" commands that don't have one.dschult2007-02-212-6/+6
* Add a predecessor routine for weighted networks called:dschult2007-02-205-14/+95
* Typo in loop structure for brandes centrality.dschult2007-02-201-2/+2
* add brandes_betweenness_centrality algorithm fromaric2007-02-201-0/+44
* simplify dijkstra routine since we have get_edge andaric2007-02-191-8/+1
* Use networkx.paths.predecessors in betweenness_centrality insteadaric2007-02-192-43/+25
* Graph/Digraph: get_edge(u,v) now returns None (instead of throwingaric2007-02-193-21/+48
* Add option to count number of edges between nodes.aric2007-02-198-5/+161
* Adjust documentation of get_edge for XGraph/XDiGraph to be more clear.aric2007-02-181-1/+1
* xslt to convert DIA to networkx, untestedaric2007-02-181-0/+114
* Documentation changes to announce more obviously thatdschult2007-02-153-7/+7
* Changed from_dict_of_lists() to handle the special case ofdschult2007-02-152-5/+33
* Further changes to convert.py to address multiedges case.aric2007-02-151-16/+23
* Update tests to check for multiedges working correctly anddschult2007-02-154-5/+39
* Attempt to address multiedge difficulties in convert.py using from_dict_of_di...dschult2007-02-151-67/+62
* Change docstring for _node_betweennessdschult2007-02-151-1/+1
* xdigraph actually doesn't inherit from xgraph - restore get_edgearic2007-02-141-0/+18
* incorrect call to _fast_predecessor from betweenness functionsaric2007-02-141-2/+2
* Allow tuple to be passed to get_edge()aric2007-02-142-22/+6
* Allow edge tuple to be passed to get_edge().aric2007-02-141-3/+6
* networkx.test() now works with or without setuptoolsaric2007-01-311-2/+4
* attempt to provide backward compatibility with matplotlib with Numericaric2007-01-232-8/+15
* floyd_warshall_array HUGE_VAL should not fail on negative edge weights.jeff2007-01-231-1/+1
* nx!=ny condition not checked and reported properly for adj matrix inputaric2007-01-221-3/+1
* fixed bug in atlas unit testswart2007-01-181-1/+1
* Fixed docs in atlas module and added some unit testsswart2007-01-182-3/+60
* typo in atlas, second G467 should be G470.aric2007-01-171-1/+1
* import matplotlib.pylab for gca()aric2007-01-141-0/+1
* Change/remove **kwds in many routines where not needed.dschult2007-01-115-52/+61
* Changes things to do with kwds in generators:dschult2007-01-114-26/+24
* put in **kwds arguments until we handle them more carefullyaric2007-01-091-3/+6
View Lorry Controller Status