UGRAMM
|
#include "../lib/UGRAMM.h"
#include "../lib/utilities.h"
#include "../lib/routing.h"
#include "../lib/drc.h"
Functions | |
int | findMinVertexModel (DirectedGraph *G, DirectedGraph *H, int y, std::map< int, NodeConfig > *hConfig, std::map< int, NodeConfig > *gConfig) |
int | findMinorEmbedding (DirectedGraph *H, DirectedGraph *G, std::map< int, NodeConfig > *hConfig, std::map< int, NodeConfig > *gConfig) |
int | main (int argc, char **argv) |
Variables | |
int | iterCount = 0 |
float | PFac = 1 |
float | HFac = 1 |
float | pfac_mul = 1.1 |
float | hfac_mul = 1 |
float | base_cost = 1 |
int | capacity = 1 |
int | max_iter = 40 |
std::vector< RoutingTree > * | Trees |
std::vector< std::list< int > > * | Users |
std::map< int, int > | invUsers |
std::vector< int > * | HistoryCosts |
std::vector< int > * | TraceBack |
std::vector< int > * | TopoOrder |
std::map< int, std::string > | hNames |
std::map< std::string, int > | hNamesInv |
std::map< int, std::string > | gNames |
std::map< std::string, int > | gNamesInv |
std::map< std::string, int > | gNamesInv_FuncCell |
std::bitset< 100000 > | explored |
std::vector< std::string > | inPin = {"inPinA", "inPinB", "anyPins"} |
std::vector< std::string > | outPin = {"outPinA"} |
std::shared_ptr< spdlog::logger > | UGRAMM = spdlog::stdout_color_mt("UGRAMM") |
std::shared_ptr< spdlog::logger > | drcLogger = spdlog::stdout_color_mt("DRC Checks") |
std::map< std::string, std::vector< std::string > > | ugrammConfig |
json | jsonParsed |
json | UgrammPragmaConfig |
int findMinorEmbedding | ( | DirectedGraph * | H, |
DirectedGraph * | G, | ||
std::map< int, NodeConfig > * | hConfig, | ||
std::map< int, NodeConfig > * | gConfig ) |
Finds a minor embedding of graph H into graph G.
int findMinVertexModel | ( | DirectedGraph * | G, |
DirectedGraph * | H, | ||
int | y, | ||
std::map< int, NodeConfig > * | hConfig, | ||
std::map< int, NodeConfig > * | gConfig ) |
Finds the minimal vertex model for embedding.
int main | ( | int | argc, |
char ** | argv ) |
Main function entry point for the UGRAMM - program.
float base_cost = 1 |
int capacity = 1 |
std::shared_ptr<spdlog::logger> drcLogger = spdlog::stdout_color_mt("DRC Checks") |
std::bitset<100000> explored |
std::map<int, std::string> gNames |
std::map<std::string, int> gNamesInv |
std::map<std::string, int> gNamesInv_FuncCell |
float HFac = 1 |
float hfac_mul = 1 |
std::vector<int>* HistoryCosts |
std::map<int, std::string> hNames |
std::map<std::string, int> hNamesInv |
std::vector<std::string> inPin = {"inPinA", "inPinB", "anyPins"} |
std::map<int, int> invUsers |
int iterCount = 0 |
json jsonParsed |
int max_iter = 40 |
std::vector<std::string> outPin = {"outPinA"} |
float PFac = 1 |
float pfac_mul = 1.1 |
std::vector<int>* TopoOrder |
std::vector<int>* TraceBack |
std::vector<RoutingTree>* Trees |
std::shared_ptr<spdlog::logger> UGRAMM = spdlog::stdout_color_mt("UGRAMM") |
std::map<std::string, std::vector<std::string> > ugrammConfig |
json UgrammPragmaConfig |
std::vector<std::list<int> >* Users |