Lines Matching refs:edges
96 std::vector<Edge> edges;
182 Graph<T>::Graph(int numv_, int nume_max_) : start(numv_, -1), edges(nume_max_)
193 edges[nume] = Edge(to, start[from], val);
321 for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)
324 int c2 = comps.find(g.edges[e_it].to);
325 if (c1 != c2 && g.edges[e_it].val.dr < hr && g.edges[e_it].val.dsp < hsp)
330 std::vector<SegmLink> edges;
331 edges.reserve(g.numv);
333 // Prepare edges connecting differnet components
337 for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)
339 int c2 = comps.find(g.edges[e_it].to);
341 edges.push_back(SegmLink(c1, c2, g.edges[e_it].val));
345 // Sort all graph's edges connecting differnet components (in asceding order)
346 std::sort(edges.begin(), edges.end());
349 for (size_t i = 0; i < edges.size(); ++i)
351 int c1 = comps.find(edges[i].from);
352 int c2 = comps.find(edges[i].to);
