Lines Matching full:edges
189 EdgeVector Edges;
203 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
204 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
226 Edges[EId] = std::move(E);
228 EId = Edges.size();
229 Edges.push_back(std::move(E));
281 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) {
321 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); }
322 bool empty() const { return G.Edges.empty(); }
324 return G.Edges.size() - G.FreeEdgeIds.size();
465 /// @brief Get the number of edges in the graph.
466 /// @return Number of edges in the graph.
611 /// longer appear in an iteration over the given node's (NId's) edges, but
612 /// will appear in an iteration over the 'other', unnamed node's edges.
620 /// Since the degree of a node is the number of connected edges,
625 /// edges.
666 Edges[EId].invalidate();
669 /// @brief Remove all nodes and edges from the graph.
673 Edges.clear();
