Lines Matching full:connected
236 // Find the connected component for a vertex implemented using the
238 // the disjoint set structure till you reach a vertex whose connected
240 // update the connected components of all the vertices. This updating
259 // where one node is connected to the other n-1 nodes does not have
279 // Disjoint-set to keep track of the connected components in the
285 // Spanning Tree graph and set each vertex to be its own connected
328 // Find the id of the connected component to which the two
330 // two of them are already connected to each other via some other
345 // Connected the two connected components by updating the
346 // disjoint_set structure. Always connect the connected component
347 // with the greater index with the connected component with the
