There’s actually a lot of goldmines out there in the outer reaches of our computer system. None of us have been to all of them, but we’ve all been to some of them. I don’t know where exactly this one is, but you can find all the scenes from it here.
This is what’s written at the entrance to the mine:
A gallery of large graphs
graph drawing of matrices in the University of Florida Collection
Graph visualization is a way to discover and visualize structures in complex relations. What sort of structures are people who do large scale computation studying? We can get a glimpse by visualizing the thousands of sparse matrices submitted to the University of Florida Sparse Matrix collection using sfdp algorithm . The resulting gallery contains the drawing of graphs as represented by 2328 sparse matrices in this collection. Each of these sparse matrices (a rectangular matrix is treated as a bipartite graph) is viewed as the adjacency matrix of an undirected graph, and is laid out by a multilevel graph drawing algorithm. If the graph is disconnected, then the largest connected component is drawn. The largest graph (Schenk@nlpkkt240) has 27,993,600 vertices and 366,327,376 edges. A simple coloring scheme is used: longer edges are colored with colder colors, and short ones warmer. The graphs are in alphabetical order. Use the “Search” link to find graphs of specific characters.