# Graph Generators¶

`Graphs.jl` implements a collection of classic graph generators, each of which returns a `simple_graph`:

`static_complete_graph`(n[, is_directed=true])

Creates a (default directed) complete graph with `n` vertices. A complete graph has edges connecting each pair of vertices.

`simple_star_graph`(n[, is_directed=true])

Creates a (default directed) star graph with `n` vertices. A star graph has a central vertex with edges to each other vertex.

`simple_path_graph,(n[, is_directed=true])`

Creates a (default directed) path graph with `n` vertices. A path graph connects each successive vertex by a single edge.

`simple_wheel_graph`(n[, is_directed=true])

Creates a (default directed) wheel graph with `n` vertices. A wheel graph is a star graph with the outer vertices connected via a closed path graph.

`simple_diamond_graph`()
`simple_bull_graph`()
`simple_chvatal_graph`()
`simple_cubical_graph`()
`simple_desargues_graph`()
`simple_dodecahedral_graph`()
`simple_frucht_graph`()
`simple_heawood_graph`()
`simple_house_graph`()

A graph mimicing the classic outline of a house.

`simple_house_x_graph`()

A house graph, with two edges crossing the bottom square.

`simple_icosahedral_graph`()
`simple_krackhardt_kite_graph`()
`moebius_kantor_graph`()
`simple_octahedral_graph`()
`simple_pappus_graph`()
`simple_petersen_graph`()
`simple_sedgewick_maze_graph`()

A simple maze graph used in Sedgewick’s Algorithms in C++: Graph Algorithms (3rd ed.)

`simple_tetrahedral_graph`()
`simple_truncated_cube_graph`()

A skeleton of the truncated cube graph.

`simple_truncated_tetrahedron_graph`()

A skeleton of the truncated tetrahedron graph.

`simple_tutte_graph`()