equal
deleted
inserted
replaced
11 * IntegerMap |
11 * IntegerMap |
12 + new algoritmhs |
12 + new algoritmhs |
13 * Lagrange relaxation based algorithm for the delay constrained least cost path problem |
13 * Lagrange relaxation based algorithm for the delay constrained least cost path problem |
14 * a preflow based general network circulation algorithm |
14 * a preflow based general network circulation algorithm |
15 * 2-approximation of Steiner-tree problem |
15 * 2-approximation of Steiner-tree problem |
16 * two heuristics for minimum cut algorithms |
16 * two heuristics for minimum cut algorithms (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps) |
17 (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps) |
|
18 * Gomory-Hu tree algorithm |
17 * Gomory-Hu tree algorithm |
19 * Edmond's Blossom shrinking algorithm |
18 * Edmond's Blossom shrinking algorithm |
20 * minimum mean cycle algorithm |
19 * minimum mean cycle algorithm |
21 * Goldberg-Tarjan algorithm (Preflow with Dynamic Trees) |
20 * Goldberg-Tarjan algorithm (Preflow with Dynamic Trees) |
22 * Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree) |
21 * Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree) |
236 * (Dual)Expr::simplify(double tolerance) added |
235 * (Dual)Expr::simplify(double tolerance) added |
237 * getDual() |
236 * getDual() |
238 + GraphToEps: |
237 + GraphToEps: |
239 * negateY() opt |
238 * negateY() opt |
240 * male/female node shapes :) |
239 * male/female node shapes :) |
241 * correct BoundingBox handling |
240 * correct %%BoundingBox handling |
242 Backward incompatibilities/changed namings: |
241 Backward incompatibilities/changed namings: |
243 * Access functions of TimeStamp/Timer |
242 * Access functions of TimeStamp/Timer |
244 * Undirected graph interface: findUEdge, ConUEdgeIt |
243 * Undirected graph interface: findUEdge, ConUEdgeIt |
245 * pred -> predEdge renaming in search algorithms |
244 * pred -> predEdge renaming in search algorithms |
246 * SnapShot -> Snapshot in {List,Smart}Graph |
245 * SnapShot -> Snapshot in {List,Smart}Graph |