Graph6 (Mathematica Import/Export Format)

Graph6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for small graphs or large ...

LEDA (Mathematica Import/Export Format)

LEDA graph data format. Commonly used exchange format for graphs. Stores a single, typed, directed, or undirected graph. Plain text format. Native graph file format of the ...

Pajek (Mathematica Import/Export Format)

Pajek graph language and data format. Commonly used exchange format for graphs. Native format of the Pajek network analysis software. The format name is Slovenian for spider. ...

Sparse6 (Mathematica Import/Export Format)

sparse6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for large sparse graphs, ...

TGF (Mathematica Import/Export Format)

TGF graph data format. Used for the storage and exchange of graphs. TGF is an acronym for Trivial Graph Format. Stores directed graphs. Stores at most one label per vertex ...

General Graph Drawing (Mathematica Tutorial)

GraphPlot and GraphPlot3D calculate and plot a visually appealing 2D/3D layout of a graph. The functions are designed to work with very large graphs and handle both connected ...

GraphML (Mathematica Import/Export Format)

GraphML graph data format. Standard exchange for graphs. GraphML is an acronym derived from Graph Markup Language. XML-based format. Represents typed, attributed, directed, ...

Arrow (Built-in Mathematica Symbol)

Arrow[{pt_1, pt_2}] is a graphics primitive that represents an arrow from pt_1 to pt_2.Arrow[{pt_1, pt_2}, s] represents an arrow with its ends set back from pt_1 and pt_2 by ...

VertexCoordinateRules (Built-in Mathematica Symbol)

VertexCoordinateRules is an option for GraphPlot and related functions which specifies rules for determining the coordinates at which vertices should be placed.

GraphDistance (Graph Utilities Package Symbol)

GraphDistance[g, i, j] gives the distance from vertex i to vertex j in the graph g.