Sheen Xavier A
Results
3
issues of
Sheen Xavier A
# Description The program finds the connected components in the graph having complexity O(E ) where E is the number of edges, V is the number of vertices and α(x)...
The program computes the connected components in a graph using disjoint set data structure. This approach has comparatively low complexity i.e. O(E α(V)).