How to get subgraphs and the largest component of a graph

[logion2000]

I have two questions related to subgraphs.
(1). What is the difference between graph.subgraph() and graph.induced_subgraph()? Are they the same function?
(2). How can I get the largest component (i.e., subgraph) of a graph? Assume the size of the graph means the number of vertices in the graph. Is there a function to do this? Or what code can achieve the goal?
Thanks.

[szhorvat]

@logion2000

(1). What is the difference between graph.subgraph() and graph.induced_subgraph()? Are they the same function?

Yes, they are the same.

@tamas, is subgraph deprecated?

@logion2000

(2). How can I get the largest component (i.e., subgraph) of a graph? Assume the size of the graph means the number of vertices in the graph. Is there a function to do this? Or what code can achieve the goal?

g.connected_components().giant()

[tamas]

@szhorvat

@tamas, is subgraph deprecated?

Yes, it is, but it’s not marked formally as deprecated. It’s not worth the fuss as it is literally a one-line alias and it does not hurt anyone to keep it around.