|
|
||
|
|
| sparse6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for large sparse graphs, stores up Related to graph6 which is optimized for small graphs or large dense graphs. Developed by Brendan McKay at the Australian National University. |
| "Elements" | list of elements and options available in this file | |
| "Rules" | full list of rules for each element and option | |
| "Options" | list of rules for options, properties and settings |
| "AdjacencyMatrix" | edge information for all graphs in this file, given as a list of sparse matrices | |
| "EdgeRules" | connectivity data for all graphs, given as an array of rules | |
| "Graphics" | first graph stored in this file, rendered as GraphPlot | |
| "GraphicsList" | all graphs stored in this file, given as a list of Graphics objects | |
| "VertexCount" | number of vertices in each graph, given as a list of integers |
| elem, n | data representation element elem for the n | |
| elem, {n1,n2,...} | element elem for graphs n1, n2, ... | |
| elem, All | element elem for all graphs, given as a list |
Import a sparse6 example file, giving a visual representation:
Read the adjacency matrix of the above example and render it as MatrixPlot:
|
| © 2008 Wolfram Research, Inc. |