* Bug: In Anabatic::Edge::getDistance(), remove the additionnal 0.1
added to horizontal edges. This was for testing before the hScaling
parameter was added (to the distance computation in GlobalRoute).
* New: Anabatic::Path_Edges, collectio to walkthrough all the edges
between two node. More complex than in Knik as we are no longer
using a regular grid. We may request the north bound path or south
bound path.
Collection returned by AnabaticEngine::getEdgesUnderPath().
* New: In Anabatic::NetData, add a new flag GlobalEstimated to tell if
the net RMST has been computed (using FLUTE).
* New: In Anabatic::PriorityQueue, used to sort Vertexes by increasing
distances, add a new criterion to be used in case of distance
equality. The attractor which should be the center of the search
area. In case of equality, we choose the Vertex which is closest
to the attractor. Give a small improvement, and more "dendritic"
trees.
For a more simple implementation of the comparison function it is
made as a static member (so no two Dijkstra objects at the same
time...).
* Change: In Anabatic::Edge, make the estimate occupance a floating
point number instead of an integer.
* New: In Katana::GlobalRoute, finally implement the estimated congestion
driven router. Net RMST estimated using FLUTE.
Use the historic cost from Knik implementation and not the one
given in Damien's thesis, which seems not be the same and a bit
strange.
* New: In KatanaEngine, add the ability to exclude nets from routing,
and export it to Python.
9e6463c217