Lines Matching refs:edges
106 EdgeList edges;
123 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
126 EdgeItr edgeItr = edges.insert(edges.end(), e);
157 /// This will clear the current graph, erasing any nodes and edges added,
188 /// \brief Get the number of edges in the graph.
189 /// @return Number of edges in the graph.
260 EdgeItr edgesBegin() { return edges.begin(); }
263 EdgeItr edgesEnd() { return edges.end(); }
267 /// @return Begin iterator for the set of edges connected to the given node.
274 /// @return End iterator for the set of edges connected to the given node.
318 return edges.end();
342 edges.erase(eItr);
346 /// \brief Remove all nodes and edges from the graph.
349 edges.clear();
374 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
