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