I have a sparse adjacency matrix (SparseMatrixCSC) representing connections between the elements of a collection. I see that I can neatly convert it to a graph with the Graph constructor from Graphs.jl . However, I know that the connections represent many smaller, unconnected graphs. Is there a way…

Connected components is probably what you’re looking for. Looks like Graphs.jl supports it for undirected graphs. In the adjacency matrix are the vertices in one graph mixed with another along the axis? Or is it something like A[1:5, 1:5] is the first graph, A[5:10, 5:10] is the second etc.

Construct multiple graphs from sparse adjacency matrix

Specific Domains Graphs

markmbaum November 29, 2021, 8:38pm 5

Yes, seems like it’s exactly what I’m looking for. Thanks! I guess I just didn’t stumble onto the correct part of the docs.

1 Like

Topic		Replies	Views
Simple question lightgraphs and matrix representation General Usage	5	1225	January 29, 2021
Giant components of graph Graphs question , graphs	2	881	November 14, 2021
Random graphs, fully-connected graphs Graphs lightgraphs , graphs	17	2570	May 31, 2020
Graph from Sparse Matrix Graphs sparse , graphs	2	659	November 3, 2021
LightGraphs -- creation of digraph? New to Julia	4	1382	April 17, 2019

Construct multiple graphs from sparse adjacency matrix

Related topics