Commits

Breadcrumbs

History for

onmaster

User selector

All users

All time

Commit History

Commits on Nov 8, 2015

• Updated python code to python 3.5

  soeltjen

  committed
  ea19192

  Copy full SHA for ea19192

Commits on Dec 31, 2011

• Fixed calculation of minimal spanning trees of graphs with negative-weighted edges.

  

  pmatiello

  committed
  f36f755

  Copy full SHA for f36f755

Commits on Nov 23, 2011

• Fixed reading of XML-stored graphs with edge attributes (patch from Daniel Merritt)

  

  pmatiello

  committed
  22790de

  Copy full SHA for 22790de

Commits on Feb 27, 2011

• Fixing a bug regarding linking, unlinking and relinking a hypernode to a hyperedge (patch by emanuelez)

  

  tomaz.kovacic

  committed
  0e0fcb0

  Copy full SHA for 0e0fcb0

Commits on Feb 9, 2011

• Bellman-Ford algorithm now works for unconnected graphs.

  

  tomaz.kovacic

  committed
  0d98501

  Copy full SHA for 0d98501

Commits on Oct 3, 2010

• Shortest-path raises KeyError when the source node is not on the graph.

  

  pmatiello

  committed
  168fb5f

  Copy full SHA for 168fb5f

Commits on Oct 1, 2010

• Removed 'big' tests as it was taking a too long time without providing any real value.

  

  pmatiello

  committed
  44ac149

  Copy full SHA for 44ac149

• A few mores tests to Gomory-Hu cut tree algorithm.

  

  pmatiello

  committed
  191859d

  Copy full SHA for 191859d

Commits on Aug 23, 2010

• Merged Gomory-Hu cut-tree algorithm (by Johannes Reinhardt).

  

  pmatiello

  committed
  1246053

  Copy full SHA for 1246053

Commits on Jul 26, 2010

• Completing tests for Pagerank algorithm.

  

  pmatiello

  committed
  c795a07

  Copy full SHA for c795a07

Commits on May 26, 2010

• Edges from one node to itself are no longer duplicated (Issue 75).

  

  pmatiello

  committed
  8bd1bb1

  Copy full SHA for 8bd1bb1

Commits on Apr 21, 2010

• Test stub for pagerank with random graph.

  

  pmatiello

  committed
  ea35248

  Copy full SHA for ea35248

Commits on Apr 18, 2010

• Tests passing in Python 2.6 and Python 3.

  

  pmatiello

  committed
  1055245

  Copy full SHA for 1055245

• Merge of pagerank, contributed by Juarez Bochi - see issue #51

  

  salimfadhley

  committed
  741bfef

  Copy full SHA for 741bfef

Commits on Mar 20, 2010

• Tests for graph/digraph/hypergraph name in dot output.

  

  pmatiello

  committed
  83490e7

  Copy full SHA for 83490e7

Commits on Mar 11, 2010

• Merged Maximum-Flow algorithm.

  

  pmatiello

  committed
  1710ada

  Copy full SHA for 1710ada

• Automatic recursion limit switch for all algorithms in accessibility.py.

  

  pmatiello

  committed
  92a1ebc

  Copy full SHA for 92a1ebc

Commits on Mar 10, 2010

• Topological sorting with deep graphs was already fixed by the DFS fix. This commit only adds a test for it.

  

  pmatiello

  committed
  6f514ee

  Copy full SHA for 6f514ee

Commits on Mar 9, 2010

• Automatic recursion limit switch for find_cycle (for deep graphs).

  Show description for ba3a4c1
  

  pmatiello

  committed
  ba3a4c1

  Copy full SHA for ba3a4c1

Commits on Mar 8, 2010

• Automatic recursion limit switch for depth first searching (for deep graphs).

  

  pmatiello

  committed
  fcc165a

  Copy full SHA for fcc165a

Commits on Feb 24, 2010

• Added the Bellman-Ford shortest path algorithm, with new exceptions in pygraph/classes/exceptions.py and relevant tests.

  

  tomaz.kovacic

  committed
  bb5d402

  Copy full SHA for bb5d402

Commits on Feb 14, 2010

• Real tests for shortest path search.

  

  pmatiello

  committed
  e26e760

  Copy full SHA for e26e760

Commits on Jan 18, 2010

• Hypergraph equality test finished.

  

  pmatiello

  committed
  bb7ebe4

  Copy full SHA for bb7ebe4

Commits on Jan 15, 2010

• Considering hyperedges and links in hypergraph equality test.

  Show description for 22815fa
  

  pmatiello

  committed
  22815fa

  Copy full SHA for 22815fa

• Fixing some comments on tests.

  

  pmatiello

  committed
  a5238e2

  Copy full SHA for a5238e2

• Starting hypergraph equality test: right now, checking for nodes only.

  

  pmatiello

  committed
  e890992

  Copy full SHA for e890992

• Adding an edge with a label to a digraph now works again.

  

  pmatiello

  committed
  5ce2e2b

  Copy full SHA for 5ce2e2b

• Considering node and edge attributes when testing for equality.

  

  pmatiello

  committed
  99426b5

  Copy full SHA for 99426b5

Commits on Jan 12, 2010

• Testing for symmetry in equality.

  

  pmatiello

  committed
  72eb405

  Copy full SHA for 72eb405

• Considering labels when testing for equality.

  

  pmatiello

  committed
  e852fc1

  Copy full SHA for e852fc1

Commits on Jan 11, 2010

• Graph and digraph equality test. Right now, it checks only if nodes, edges and edge weights match. No attribute and label support yet. No hypergraph support yet.

  

  pmatiello

  committed
  ee00ad9

  Copy full SHA for ee00ad9

Commits on Dec 3, 2009

• Fixing XML reading.

  

  pmatiello

  committed
  ba6ccfa

  Copy full SHA for ba6ccfa

Commits on Dec 2, 2009

• Test stubs for shortest path.

  

  pmatiello

  committed
  59ef1e1

  Copy full SHA for 59ef1e1

• Correct test class naming.

  

  pmatiello

  committed
  d2cd282

  Copy full SHA for d2cd282

• Test for Minimal Spanning Tree.

  

  pmatiello

  committed
  712ec53

  Copy full SHA for 712ec53