Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Commits on Sep 1, 2015
  1. @dschult

    Merge pull request #1756 from MisterSheik/topo-fixed

    dschult authored
    rewrite topolgical_sort, add lexicographical_topological_sort
  2. @dschult

    Merge pull request #1734 from aureooms/faster-maximal-matching

    dschult authored
    constant factor improvement for maximal_matching
  3. @dschult

    Merge pull request #1735 from aureooms/weight-parameter-for-max-weigh…

    dschult authored
    …t-matching
    
    Add weight parameter for max_weight_matching
  4. @MisterSheik
Commits on Aug 31, 2015
  1. @MisterSheik

    Update misc.py

    MisterSheik authored
  2. @MisterSheik

    topolgical_sort, lexicographical_topological_sort

    MisterSheik authored
    Rewrote topolgical_sort as a generator:
    * It no longer accepts reverse or nbunch arguments
    * It is slightly faster.
    Added lexicographical_topological_sort, which accepts a key.
    Some tests for topological sort were removed because they relied on
    CPython's particular dict element ordering.
    Added utils from more_itertools:
    * These were necessary for working with the new generators.
    * "pairwise" is equavalent to zip(some_list, some_list[1:]) -- for
    generators.
    * "consume" consumes an iterator.
  3. @MisterSheik
  4. @MisterSheik

    .

    MisterSheik authored
  5. @MisterSheik

    topolgical_sort, lexicographical_topological_sort

    MisterSheik authored
    Rewrote topolgical_sort as a generator:
    * It no longer accepts reverse or nbunch arguments
    * It is slightly faster.
    Added lexicographical_topological_sort, which accepts a key.
    Some tests for topological sort were removed because they relied on
    CPython's particular dict element ordering.
    Added utils from more_itertools:
    * These were necessary for working with the new generators.
    * "pairwise" is equavalent to zip(some_list, some_list[1:]) -- for
    generators.
    * "consume" consumes an iterator.
  6. @aureooms
Commits on Aug 29, 2015
  1. @dschult

    Merge pull request #1722 from chrisnatali/master

    dschult authored
    Added MultiLineString support in reading Graph from shapefile
Commits on Aug 26, 2015
  1. @dschult

    Merge pull request #1747 from grail/master

    dschult authored
    dag: add more information to exception message when cycle detected
Commits on Aug 25, 2015
  1. dag: add more information to exception message when cycle detected

    Eden G. Adogla authored
    This change adds the node identifier to exception message produced when
    a cycle is detected during a topological sort.
    
    Signed-off-by: Eden G. Adogla <eden@edengrail.io>
  2. @dschult

    Merge pull request #1743 from MridulS/gendoc

    dschult authored
    Change file permission and update random graph generator with iter changes
Commits on Aug 18, 2015
  1. @MridulS
  2. @MridulS

    Change file permission

    MridulS authored
Commits on Aug 17, 2015
  1. @dschult

    Merge pull request #1742 from MridulS/doc

    dschult authored
    Update documentation of shortest_path_length
  2. @MridulS
Commits on Aug 16, 2015
  1. @dschult

    Merge pull request #1739 from MridulS/shortestpath

    dschult authored
    Update single_source_shortest_path_length and all_pairs_shortest_path_length to return iterators
Commits on Aug 13, 2015
  1. @MridulS

    Solve merge conflicts

    MridulS authored
  2. @MridulS

    Update single_source_shortest_path_length and all_pairs_shortest_path…

    MridulS authored
    …_length to return iterators
  3. @dschult

    Merge pull request #1714 from stsouko/master

    dschult authored
    in compose() function, merge data of G and H instead of replacing G with H
Commits on Aug 12, 2015
  1. @aureooms
  2. @aureooms

    update docstring of max_weight_matching

    aureooms authored
    to match the addition of the 'weight' attribute parameter
  3. @aureooms
  4. @aureooms

    constant factor improvement for maximal_matching

    aureooms authored
    keep a set of used vertices instead of used edges
Commits on Aug 11, 2015
  1. @hagberg

    Merge pull request #1730 from jfinkels/test-cuts-set-indexing

    hagberg authored
    Don't use indexing to access elements of a set
  2. @hagberg

    Merge pull request #1732 from dschult/shift_power_method

    hagberg authored
    Eigenvector_centrality power method shifted to A+I
Commits on Aug 10, 2015
  1. @dschult

    Eigenvector_centrality power method shifted to A+I

    dschult authored
    By computing eigenvectors with repeated multiplication by A+I
    the spectrum is shifted so that the positive real eigenvalue
    is dominant even for odd path graphs and others with multiple
    dominant eigenvalues.
  2. @jfinkels

    Don't use indexing to access elements of a set

    jfinkels authored
    Replaces indexing with `arbitrary_element()` function.
Commits on Aug 8, 2015
  1. @hagberg

    Merge pull request #1719 from dschult/minor_doc_changes

    hagberg authored
    minor changes related to _iter removal
  2. @hagberg

    Merge pull request #1720 from dschult/update_news

    hagberg authored
    Update news.rst to include 1.10 release highlights
  3. @hagberg

    Merge pull request #1721 from dschult/convert_bug

    hagberg authored
    to_networkx_graph needs .update() instead of new dict
Commits on Aug 7, 2015
  1. @chrisnatali
  2. @dschult

    to_networkx_graph needs .update() instead of new dict

    dschult authored
    In convert.to_networkx_graph, we need to use
    create_using.node.update() instead of creating a new dict
    for the node atrributes. We were overwriting instead of updating.
Something went wrong with that request. Please try again.