128       NodeEntry &n1 = getNode(ne.getNode1());  in addConstructedEdge()  local
131       assert((n1.getCosts().getLength() == ne.getCosts().getRows()) &&  in addConstructedEdge()
134       ne.setNode1AEItr(n1.addEdge(edgeItr));  in addConstructedEdge()
338       NodeEntry &n1 = getNode(e.getNode1());  in removeEdge()  local
340       n1.removeEdge(e.getNode1AEItr());  in removeEdge()
372         unsigned n1 = std::distance(nodesBegin(), getEdgeNode1(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()