Commits

Branch selector

 master

User selector

solleks

Datepicker

All time

Commit History

Commits on Oct 22, 2013

• Don't use graph edge id's in spanning tree

  solleks

  committed
  944a5bc

  Copy full SHA for 944a5bc

Commits on Oct 21, 2013

• Rely on minLen property. Improve code coverage.

  solleks

  committed
  816078e

  Copy full SHA for 816078e

Commits on Oct 19, 2013

• Merge with cpettitt/master

  solleks

  committed
  8d7b1d7

  Copy full SHA for 8d7b1d7

Commits on Oct 18, 2013

• Adjust ranks as feasible tree changes. Add test for network simplex ranking

  solleks

  committed
  512520c

  Copy full SHA for 512520c

Commits on Oct 17, 2013

• Duplicate ranking tests using network simplex

  solleks

  committed
  50caa7c

  Copy full SHA for 50caa7c

• Add more descriptive comments

  solleks

  committed
  86ca77e

  Copy full SHA for 86ca77e

• Require Digraph to build network simplex spanning tree

  solleks

  committed
  60ce738

  Copy full SHA for 60ce738

• Merge exp-rank-fixes branch with simplex branch

  solleks

  committed
  3603b43

  Copy full SHA for 3603b43

Commits on Oct 15, 2013

• Add network simplex as an option for ranking

  solleks

  committed
  6675f33

  Copy full SHA for 6675f33

Commits on Oct 11, 2013

• Add tests. Reverse edges to min and from max in acyclic

  solleks

  committed
  24e78da

  Copy full SHA for 24e78da

• Remove simplex algorithm from master branch

  solleks

  committed
  3479d82

  Copy full SHA for 3479d82

Commits on Oct 9, 2013

• Use prefRank for ranking constraints

  solleks

  committed
  597dfbf

  Copy full SHA for 597dfbf

• Bug fixes after merge

  solleks

  committed
  2bbb2c6

  Copy full SHA for 2bbb2c6

Commits on Oct 8, 2013

• Merge branch 'master' of https://github.com/cpettitt/dagre into cpettitt-master

  Show description for 91f91d1
  solleks

  committed
  91f91d1

  Copy full SHA for 91f91d1

• Start on assigning nodes to ranks

  solleks

  committed
  a2016bb

  Copy full SHA for a2016bb

Commits on Oct 7, 2013

• Remove debugging statements

  solleks

  committed
  1a7286f

  Copy full SHA for 1a7286f

Commits on Oct 3, 2013

• Handle arbitrary fanout in spanning tree

  solleks

  committed
  504afa5

  Copy full SHA for 504afa5

• Fixed bugs in cut value computation

  solleks

  committed
  62edb69

  Copy full SHA for 62edb69

Commits on Sep 13, 2013

• Checkpoint before trying Graphviz network simplex algorithm

  solleks

  committed
  7739fe5

  Copy full SHA for 7739fe5

Commits on Sep 12, 2013

• Network simplex algorithm for ranking

  solleks

  committed
  3f32da9

  Copy full SHA for 3f32da9

Commits on Sep 10, 2013

• Build explicit feasible tree

  solleks

  committed
  5d972bf

  Copy full SHA for 5d972bf

Commits on Sep 9, 2013

• Make feasible tree explicit

  solleks

  committed
  98510d7

  Copy full SHA for 98510d7