Initial work on leaveEdge
Include lodash in package for now
Initial implementation of enterEdge
Initial implementation of exchange for rank
Remove edgeIter
Collapse network simplex functions into a single module
Improvements to longest-path-test

- Simplify object construction.
- Add another test.
Initial work on net simplex
Add feasible tree to network simplex
More tests for network simplex
Assign low-lim and cut values to nodes during net simplex
Add test for initCutValues + some test refactoring
Don't require root node for initLowLimValues
s/exchange/exchangeEdges/
Use assignCutValue from updateCutValues
Some test cleanup for enter edge
Add more tests for enter edge + refactoring
Create a fake root if necessary during ranking
Initial pass on net simplex done

This still leaves a lot of room for optimization
Add initial benchmarks for ranking algorithms