Limbo
|
A greedy search algorithm for placement. More...
#include <iostream>
#include <iterator>
Go to the source code of this file.
Classes | |
struct | limbo::algorithms::placement::gs_choose_type< T > |
struct | limbo::algorithms::placement::gs_choose_type< T * > |
class | limbo::algorithms::placement::GreedySearch< CallbackType > |
Namespaces | |
limbo | |
namespace for Limbo | |
limbo::algorithms | |
namespace for Limbo.algorithms | |
limbo::algorithms::placement | |
namespace for Limbo.Algorithms.Placement | |
A greedy search algorithm for placement.
This class provides generic functions to bruce-force search all legal positions (including swap with smaller cells) within displacment range. The flow can be customized, but the basic functions can be shared. This approach is very powerful to legalize a placement or find positions without stitch or conflict in DFM aware placement.
Definition in file GreedySearch.h.