MatrixNetworks.jl

Graphs are treated as adjacency matrices (SparseMatrixCSC or MatrixNetwork), enabling seamless integration with linear algebra operations, as shown in functions like bfs(A, u) where A is a matrix.

Includes BFS, strongly connected components, bipartite matching, and clustering coefficients, with enriched outputs such as reduction matrices from scomponents via enrich(sc).

Provides accessible datasets via matrix_network_datasets() and load_matrix_network, facilitating quick experimentation, as demonstrated in examples like load_matrix_network("clique-10").

Blurs the distinction between matrices and networks, making it intuitive for those familiar with matrix operations, as emphasized in the package's philosophy.