Trait LargestConnectedComponent 

pub trait LargestConnectedComponent {
    // Required method
    fn largest_connected_component(&self) -> NodeSubgraph<Self>
       where Self: StaticGraphViewOps;
}

Gives the large connected component of a graph. The large connected component is the largest (i.e., with the highest number of nodes) connected sub-graph of the network.

Example Usage:

g.largest_connected_component()

Returns:

A raphtory graph, which essentially is a sub-graph of the graph g

Required Methods

fn largest_connected_component(&self) -> NodeSubgraph<Self>

where Self: StaticGraphViewOps,

Implementors

impl LargestConnectedComponent for Graph