Lines Matching refs:n2
129 NodeEntry &n2 = getNode(ne.getNode2());
132 (n2.getCosts().getLength() == ne.getCosts().getCols()) &&
135 ne.setNode2AEItr(n2.addEdge(edgeItr));
339 NodeEntry &n2 = getNode(e.getNode2());
341 n2.removeEdge(e.getNode2AEItr());
373 unsigned n2 = std::distance(nodesBegin(), getEdgeNode2(edgeItr));
374 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
376 os << "\n" << n1 << " " << n2 << "\n"
427 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
428 return &*n1 < &*n2;
431 bool operator()(Graph::ConstNodeItr n1, Graph::ConstNodeItr n2) const {
432 return &*n1 < &*n2;