ed2cd18c48
* Bug: In Knik, in Graph::Dijsktra(), when all the RoutingPads of a net
are aligned, the seaching area is only one vertex wide (in width or
height). That is, it contains only one edge in it's main direction.
So when that sub-graph contains a fully blocked edge, Dijkstra cannot
find a path... Now enlarge the one edge graph to at least three by
inflating the search area. Curiously a code for similar purpose seems
to be present, but commented.
|
||
|---|---|---|
| .. | ||
| cmake_modules | ||
| doc | ||
| src | ||
| CMakeLists.txt | ||
| doxyfile | ||