graph-generators-0.1.4.0: Functions for generating structured or random FGL graphs

Data.Graph.Generators.Classic

Description

Generators for classic non-parametric graphs.

Built using NetworkX 1.8.1, see NetworkX Generators

# Documentation

Generates the trivial graph, containing only one node and no edges

Generates the Bull graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected

    0       1
/
2---3
/
4


Generate the Chvatal graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the cubical graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Desargues graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Diamond Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the dodecahedral Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Frucht Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected

Generate the Heawood Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the house graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected

    1
/
2---3
|   |
4---5


Generate the house X graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected

    1
/
2---3
| X |
4---5


Generate the icosahedral Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Krackhardt-Kite Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Möbius-Kantor Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the octahedral graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Pappus Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Nodes are labelled [0..17]

Generate the Petersen Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Sedgewick Maze Graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the tetrahedral graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the truncated cube graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the truncated tetrahedron graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

Generate the Tutte graph.

Contains only one edge between two connected nodes, use undir to make it quasi-undirected.

The null graph with no nodes and edges