Back
Add Comment
Topics
Vote
Results
connected component of a graph
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous