How can you remove all sub-graphs that are not part of the largest component of connected sub-graphs?

I imagine generating equivalence relations between the sub-graphs and doing some sort of union-find operation would be the way to go about this, but how to do this? Can somebody give an example?

Answer 1

[Matt J]

Given a agraph, G,

    bins=biconncomp(G);
    
    [~,cmaj]=max(histcounts(bins,1:max(bins)+1));
    ekeep=find(bins==cmaj);
    [sk,tk]=findedge(G,ekeep);

    G=graph(sk,tk);

[Steven Lord]

Why not use the 'cell' OutputFormat for biconncomp and use subgraph with each cell in the output, as shown in the "Extract Biconnected Components as Subgraphs" example on the biconncomp documentation page?

[L'O.G.]

@Matt J Thank you. I think you mean G rather than Gp in the second-to-last line, right?

[Matt J]

Yes, I do.

[L'O.G.]

Thank you both.