Dear all, Is there any function to get a subset of graph that have largest connected component using Graphs.jl (version >= 1.4.1)? I only found function connected_components that return a list of connected vertices? In function connected_components g = SimpleGraph([0 1 0 0 0; 1 0 1 0 0; 0 1 0 0…

How about this? function main_component(g) c = connected_components(g) _, i = findmax(length.(c)) g[c[i]] end julia> g = erdos_renyi(1000, 1000) {1000, 1000} undirected simple Int64 graph julia> main_component(g) {802, 970} undirected simple Int64 graph

Giant components of graph

Specific Domains Graphs

yusri-dh November 14, 2021, 12:08am 3

Great! Thank you so much for the solution.

Topic		Replies	Views
Test if two vertices are connected in a graph Graphs question , graphs	4	515	December 18, 2023
What is the optimised way to find connected components in a graph with edge weights greater than zero? Graphs question , graphs	4	549	August 18, 2022
Construct multiple graphs from sparse adjacency matrix Graphs question , graphs	4	795	November 29, 2021
Random graphs, fully-connected graphs Graphs lightgraphs , graphs	17	2615	May 31, 2020
Cutting graphs at bridges Graphs graphs	4	317	May 22, 2024

Giant components of graph

Related topics