Data.Graph.Generators.Classic

Generators for classic non-parametric graphs.

Built using NetworkX 1.8.1, see NetworkX Generators

graph-generators copyright: Copyright (C) 2014 Uli Köhler Apache License v2.0

NetworkX copyright: Copyright (C) 2004-2010 by Aric Hagberg [e-mail] Dan Schult [e-mail] Pieter Swart [e-mail] All rights reserved. BSD license.

Documentation

trivialGraph :: GraphInfo

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

bullGraph :: GraphInfo

Generates the Bull graph.

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

    0       1
          /
      2---3
        /
        4

chvatalGraph :: GraphInfo

Generate the Chvatal graph.

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

cubicalGraph :: GraphInfo

Generate the cubical graph.

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

desarguesGraph :: GraphInfo

Generate the Desargues graph.

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

diamondGraph :: GraphInfo

Generate the Diamond Graph.

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

dodecahedralGraph :: GraphInfo

Generate the dodecahedral Graph.

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

fruchtGraph :: GraphInfo

Generate the Frucht Graph.

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

See http://mathworld.wolfram.com/FruchtGraph.html

heawoodGraph :: GraphInfo

Generate the Heawood Graph.

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

houseGraph :: GraphInfo

Generate the house graph.

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

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

houseXGraph :: GraphInfo

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

icosahedralGraph :: GraphInfo

Generate the icosahedral Graph.

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

krackhardtKiteGraph :: GraphInfo

Generate the Krackhardt-Kite Graph.

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

moebiusKantorGraph :: GraphInfo

Generate the Möbius-Kantor Graph.

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

octahedralGraph :: GraphInfo

Generate the octahedral graph.

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

pappusGraph :: GraphInfo

Generate the Pappus Graph.

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

Nodes are labelled [0..17]

petersenGraph :: GraphInfo

Generate the Petersen Graph.

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

sedgewickMazeGraph :: GraphInfo

Generate the Sedgewick Maze Graph.

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

tetrahedralGraph :: GraphInfo

Generate the tetrahedral graph.

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

truncatedCubeGraph :: GraphInfo

Generate the truncated cube graph.

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

truncatedTetrahedronGraph :: GraphInfo

Generate the truncated tetrahedron graph.

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

tutteGraph :: GraphInfo

Generate the Tutte graph.

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

nullGraph :: GraphInfo

The null graph with no nodes and edges