DistGraph DistGraph::operator()( const vector<Int>& I, Range<Int> J ) const { DEBUG_ONLY(CSE cse("Graph::operator()")) DistGraph subGraph(this->Comm()); GetSubgraph( *this, I, J, subGraph ); return subGraph; }
DistGraph DistGraph::operator()( const vector<Int>& I, Range<Int> J ) const { EL_DEBUG_CSE DistGraph subGraph(this->Comm()); GetSubgraph( *this, I, J, subGraph ); return subGraph; }
void RippleCarryAdder::FullAdder::run() { unsigned char a = m_a->readBool() ? 0x01 : 0x00; unsigned char b = m_b->readBool() ? 0x01 : 0x00; unsigned char cin = m_cin->readBool() ? 0x01 : 0x00; qDebug() << "adder:" << name() << "a:" << bool(a) << "b:" << bool(b) << "cin:" << bool(cin) << "cout:" << bool((a & b) | (cin & (a ^ b))) << "s:" << bool(a ^ b ^ cin); subGraph()->run(); }
void BinaryMultiplier::run() { /* // FIXME: this manual run code won't be needed in the future m_bToBools->run(); foreach(Component *c, m_anders) { c->run(); } foreach(Component *c, m_shifters) { c->run(); } foreach(Component *c, m_adders) { c->run(); } */ subGraph()->run(); }
void RippleCarryAdder::run() { subGraph()->run(); }
Route Gene::calculateBestRoute(const Graph &graph) const { SubGraph subGraph(graph, getVerticesList()); TSP tsp(subGraph); Route route = tsp.run(isClosed); return subGraph.getOriginalRoute(route); }