<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>networkx.generators.small — NetworkX 1.8.1 documentation</title>
<link rel="stylesheet" href="../../../_static/networkx.css" type="text/css" />
<link rel="stylesheet" href="../../../_static/pygments.css" type="text/css" />
<script type="text/javascript">
var DOCUMENTATION_OPTIONS = {
URL_ROOT: '../../../',
VERSION: '1.8.1',
COLLAPSE_INDEX: false,
FILE_SUFFIX: '.html',
HAS_SOURCE: false
};
</script>
<script type="text/javascript" src="../../../_static/jquery.js"></script>
<script type="text/javascript" src="../../../_static/underscore.js"></script>
<script type="text/javascript" src="../../../_static/doctools.js"></script>
<link rel="search" type="application/opensearchdescription+xml"
title="Search within NetworkX 1.8.1 documentation"
href="../../../_static/opensearch.xml"/>
<link rel="top" title="NetworkX 1.8.1 documentation" href="../../../index.html" />
<link rel="up" title="networkx" href="../../networkx.html" />
</head>
<body>
<div style="color: black;background-color: white; font-size: 3.2em; text-align: left; padding: 15px 10px 10px 15px">
NetworkX
</div>
<div class="related">
<h3>Navigation</h3>
<ul>
<li class="right" style="margin-right: 10px">
<a href="../../../genindex.html" title="General Index"
accesskey="I">index</a></li>
<li class="right" >
<a href="../../../py-modindex.html" title="Python Module Index"
>modules</a> |</li>
<li><a href="http://networkx.github.com/">NetworkX Home </a> | </li>
<li><a href="http://networkx.github.com/documentation.html">Documentation </a>| </li>
<li><a href="http://networkx.github.com/download.html">Download </a> | </li>
<li><a href="http://github.com/networkx">Developer (Github)</a></li>
<li><a href="../../index.html" >Module code</a> »</li>
<li><a href="../../networkx.html" accesskey="U">networkx</a> »</li>
</ul>
</div>
<div class="sphinxsidebar">
<div class="sphinxsidebarwrapper">
<div id="searchbox" style="display: none">
<h3>Quick search</h3>
<form class="search" action="../../../search.html" method="get">
<input type="text" name="q" />
<input type="submit" value="Go" />
<input type="hidden" name="check_keywords" value="yes" />
<input type="hidden" name="area" value="default" />
</form>
<p class="searchtip" style="font-size: 90%">
Enter search terms or a module, class or function name.
</p>
</div>
<script type="text/javascript">$('#searchbox').show(0);</script>
</div>
</div>
<div class="document">
<div class="documentwrapper">
<div class="bodywrapper">
<div class="body">
<h1>Source code for networkx.generators.small</h1><div class="highlight"><pre>
<span class="c"># -*- coding: utf-8 -*-</span>
<span class="sd">"""</span>
<span class="sd">Various small and named graphs, together with some compact generators.</span>
<span class="sd">"""</span>
<span class="n">__author__</span> <span class="o">=</span><span class="s">"""Aric Hagberg (hagberg@lanl.gov)</span><span class="se">\n</span><span class="s">Pieter Swart (swart@lanl.gov)"""</span>
<span class="c"># Copyright (C) 2004-2008 by </span>
<span class="c"># Aric Hagberg <hagberg@lanl.gov></span>
<span class="c"># Dan Schult <dschult@colgate.edu></span>
<span class="c"># Pieter Swart <swart@lanl.gov></span>
<span class="c"># All rights reserved.</span>
<span class="c"># BSD license.</span>
<span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s">'make_small_graph'</span><span class="p">,</span>
<span class="s">'LCF_graph'</span><span class="p">,</span>
<span class="s">'bull_graph'</span><span class="p">,</span>
<span class="s">'chvatal_graph'</span><span class="p">,</span>
<span class="s">'cubical_graph'</span><span class="p">,</span>
<span class="s">'desargues_graph'</span><span class="p">,</span>
<span class="s">'diamond_graph'</span><span class="p">,</span>
<span class="s">'dodecahedral_graph'</span><span class="p">,</span>
<span class="s">'frucht_graph'</span><span class="p">,</span>
<span class="s">'heawood_graph'</span><span class="p">,</span>
<span class="s">'house_graph'</span><span class="p">,</span>
<span class="s">'house_x_graph'</span><span class="p">,</span>
<span class="s">'icosahedral_graph'</span><span class="p">,</span>
<span class="s">'krackhardt_kite_graph'</span><span class="p">,</span>
<span class="s">'moebius_kantor_graph'</span><span class="p">,</span>
<span class="s">'octahedral_graph'</span><span class="p">,</span>
<span class="s">'pappus_graph'</span><span class="p">,</span>
<span class="s">'petersen_graph'</span><span class="p">,</span>
<span class="s">'sedgewick_maze_graph'</span><span class="p">,</span>
<span class="s">'tetrahedral_graph'</span><span class="p">,</span>
<span class="s">'truncated_cube_graph'</span><span class="p">,</span>
<span class="s">'truncated_tetrahedron_graph'</span><span class="p">,</span>
<span class="s">'tutte_graph'</span><span class="p">]</span>
<span class="kn">import</span> <span class="nn">networkx</span> <span class="kn">as</span> <span class="nn">nx</span>
<span class="kn">from</span> <span class="nn">networkx.generators.classic</span> <span class="kn">import</span> <span class="n">empty_graph</span><span class="p">,</span> <span class="n">cycle_graph</span><span class="p">,</span> <span class="n">path_graph</span><span class="p">,</span> <span class="n">complete_graph</span>
<span class="kn">from</span> <span class="nn">networkx.exception</span> <span class="kn">import</span> <span class="n">NetworkXError</span>
<span class="c">#------------------------------------------------------------------------------</span>
<span class="c"># Tools for creating small graphs</span>
<span class="c">#------------------------------------------------------------------------------</span>
<span class="k">def</span> <span class="nf">make_small_undirected_graph</span><span class="p">(</span><span class="n">graph_description</span><span class="p">,</span> <span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Return a small undirected graph described by graph_description.</span>
<span class="sd"> See make_small_graph.</span>
<span class="sd"> """</span>
<span class="k">if</span> <span class="n">create_using</span> <span class="ow">is</span> <span class="ow">not</span> <span class="bp">None</span> <span class="ow">and</span> <span class="n">create_using</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span>
<span class="k">raise</span> <span class="n">NetworkXError</span><span class="p">(</span><span class="s">"Directed Graph not supported"</span><span class="p">)</span>
<span class="k">return</span> <span class="n">make_small_graph</span><span class="p">(</span><span class="n">graph_description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<div class="viewcode-block" id="make_small_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.make_small_graph.html#networkx.generators.small.make_small_graph">[docs]</a><span class="k">def</span> <span class="nf">make_small_graph</span><span class="p">(</span><span class="n">graph_description</span><span class="p">,</span> <span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Return the small graph described by graph_description.</span>
<span class="sd"> graph_description is a list of the form [ltype,name,n,xlist]</span>
<span class="sd"> Here ltype is one of "adjacencylist" or "edgelist",</span>
<span class="sd"> name is the name of the graph and n the number of nodes.</span>
<span class="sd"> This constructs a graph of n nodes with integer labels 0,..,n-1.</span>
<span class="sd"> </span>
<span class="sd"> If ltype="adjacencylist" then xlist is an adjacency list</span>
<span class="sd"> with exactly n entries, in with the j'th entry (which can be empty)</span>
<span class="sd"> specifies the nodes connected to vertex j.</span>
<span class="sd"> e.g. the "square" graph C_4 can be obtained by</span>
<span class="sd"> >>> G=nx.make_small_graph(["adjacencylist","C_4",4,[[2,4],[1,3],[2,4],[1,3]]])</span>
<span class="sd"> or, since we do not need to add edges twice,</span>
<span class="sd"> </span>
<span class="sd"> >>> G=nx.make_small_graph(["adjacencylist","C_4",4,[[2,4],[3],[4],[]]])</span>
<span class="sd"> </span>
<span class="sd"> If ltype="edgelist" then xlist is an edge list </span>
<span class="sd"> written as [[v1,w2],[v2,w2],...,[vk,wk]],</span>
<span class="sd"> where vj and wj integers in the range 1,..,n</span>
<span class="sd"> e.g. the "square" graph C_4 can be obtained by</span>
<span class="sd"> </span>
<span class="sd"> >>> G=nx.make_small_graph(["edgelist","C_4",4,[[1,2],[3,4],[2,3],[4,1]]])</span>
<span class="sd"> Use the create_using argument to choose the graph class/type. </span>
<span class="sd"> """</span>
<span class="n">ltype</span><span class="o">=</span><span class="n">graph_description</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
<span class="n">name</span><span class="o">=</span><span class="n">graph_description</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span>
<span class="n">n</span><span class="o">=</span><span class="n">graph_description</span><span class="p">[</span><span class="mi">2</span><span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">empty_graph</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">nodes</span><span class="o">=</span><span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">()</span>
<span class="k">if</span> <span class="n">ltype</span><span class="o">==</span><span class="s">"adjacencylist"</span><span class="p">:</span>
<span class="n">adjlist</span><span class="o">=</span><span class="n">graph_description</span><span class="p">[</span><span class="mi">3</span><span class="p">]</span>
<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">adjlist</span><span class="p">)</span> <span class="o">!=</span> <span class="n">n</span><span class="p">:</span>
<span class="k">raise</span> <span class="n">NetworkXError</span><span class="p">(</span><span class="s">"invalid graph_description"</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([(</span><span class="n">u</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">nodes</span> <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="n">adjlist</span><span class="p">[</span><span class="n">v</span><span class="p">]])</span>
<span class="k">elif</span> <span class="n">ltype</span><span class="o">==</span><span class="s">"edgelist"</span><span class="p">:</span>
<span class="n">edgelist</span><span class="o">=</span><span class="n">graph_description</span><span class="p">[</span><span class="mi">3</span><span class="p">]</span>
<span class="k">for</span> <span class="n">e</span> <span class="ow">in</span> <span class="n">edgelist</span><span class="p">:</span>
<span class="n">v1</span><span class="o">=</span><span class="n">e</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">-</span><span class="mi">1</span>
<span class="n">v2</span><span class="o">=</span><span class="n">e</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span><span class="o">-</span><span class="mi">1</span>
<span class="k">if</span> <span class="n">v1</span><span class="o"><</span><span class="mi">0</span> <span class="ow">or</span> <span class="n">v1</span><span class="o">></span><span class="n">n</span><span class="o">-</span><span class="mi">1</span> <span class="ow">or</span> <span class="n">v2</span><span class="o"><</span><span class="mi">0</span> <span class="ow">or</span> <span class="n">v2</span><span class="o">></span><span class="n">n</span><span class="o">-</span><span class="mi">1</span><span class="p">:</span>
<span class="k">raise</span> <span class="n">NetworkXError</span><span class="p">(</span><span class="s">"invalid graph_description"</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">v1</span><span class="p">,</span><span class="n">v2</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="n">name</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="LCF_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.LCF_graph.html#networkx.generators.small.LCF_graph">[docs]</a><span class="k">def</span> <span class="nf">LCF_graph</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="n">shift_list</span><span class="p">,</span><span class="n">repeats</span><span class="p">,</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Return the cubic graph specified in LCF notation.</span>
<span class="sd"> LCF notation (LCF=Lederberg-Coxeter-Fruchte) is a compressed</span>
<span class="sd"> notation used in the generation of various cubic Hamiltonian</span>
<span class="sd"> graphs of high symmetry. See, for example, dodecahedral_graph,</span>
<span class="sd"> desargues_graph, heawood_graph and pappus_graph below.</span>
<span class="sd"> </span>
<span class="sd"> n (number of nodes)</span>
<span class="sd"> The starting graph is the n-cycle with nodes 0,...,n-1.</span>
<span class="sd"> (The null graph is returned if n < 0.)</span>
<span class="sd"> shift_list = [s1,s2,..,sk], a list of integer shifts mod n,</span>
<span class="sd"> repeats</span>
<span class="sd"> integer specifying the number of times that shifts in shift_list</span>
<span class="sd"> are successively applied to each v_current in the n-cycle</span>
<span class="sd"> to generate an edge between v_current and v_current+shift mod n.</span>
<span class="sd"> For v1 cycling through the n-cycle a total of k*repeats</span>
<span class="sd"> with shift cycling through shiftlist repeats times connect</span>
<span class="sd"> v1 with v1+shift mod n</span>
<span class="sd"> </span>
<span class="sd"> The utility graph K_{3,3}</span>
<span class="sd"> >>> G=nx.LCF_graph(6,[3,-3],3)</span>
<span class="sd"> </span>
<span class="sd"> The Heawood graph</span>
<span class="sd"> >>> G=nx.LCF_graph(14,[5,-5],7)</span>
<span class="sd"> See http://mathworld.wolfram.com/LCFNotation.html for a description</span>
<span class="sd"> and references.</span>
<span class="sd"> </span>
<span class="sd"> """</span>
<span class="k">if</span> <span class="n">create_using</span> <span class="ow">is</span> <span class="ow">not</span> <span class="bp">None</span> <span class="ow">and</span> <span class="n">create_using</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span>
<span class="k">raise</span> <span class="n">NetworkXError</span><span class="p">(</span><span class="s">"Directed Graph not supported"</span><span class="p">)</span>
<span class="k">if</span> <span class="n">n</span> <span class="o"><=</span> <span class="mi">0</span><span class="p">:</span>
<span class="k">return</span> <span class="n">empty_graph</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="c"># start with the n-cycle</span>
<span class="n">G</span><span class="o">=</span><span class="n">cycle_graph</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"LCF_graph"</span>
<span class="n">nodes</span><span class="o">=</span><span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">()</span>
<span class="n">n_extra_edges</span><span class="o">=</span><span class="n">repeats</span><span class="o">*</span><span class="nb">len</span><span class="p">(</span><span class="n">shift_list</span><span class="p">)</span>
<span class="c"># edges are added n_extra_edges times</span>
<span class="c"># (not all of these need be new)</span>
<span class="k">if</span> <span class="n">n_extra_edges</span> <span class="o"><</span> <span class="mi">1</span><span class="p">:</span>
<span class="k">return</span> <span class="n">G</span>
<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_extra_edges</span><span class="p">):</span>
<span class="n">shift</span><span class="o">=</span><span class="n">shift_list</span><span class="p">[</span><span class="n">i</span><span class="o">%</span><span class="nb">len</span><span class="p">(</span><span class="n">shift_list</span><span class="p">)]</span> <span class="c">#cycle through shift_list</span>
<span class="n">v1</span><span class="o">=</span><span class="n">nodes</span><span class="p">[</span><span class="n">i</span><span class="o">%</span><span class="n">n</span><span class="p">]</span> <span class="c"># cycle repeatedly through nodes</span>
<span class="n">v2</span><span class="o">=</span><span class="n">nodes</span><span class="p">[(</span><span class="n">i</span> <span class="o">+</span> <span class="n">shift</span><span class="p">)</span><span class="o">%</span><span class="n">n</span><span class="p">]</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">v1</span><span class="p">,</span> <span class="n">v2</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
<span class="c">#-------------------------------------------------------------------------------</span>
<span class="c"># Various small and named graphs</span>
<span class="c">#-------------------------------------------------------------------------------</span>
</div>
<div class="viewcode-block" id="bull_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.bull_graph.html#networkx.generators.small.bull_graph">[docs]</a><span class="k">def</span> <span class="nf">bull_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Bull graph. """</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Bull Graph"</span><span class="p">,</span>
<span class="mi">5</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">2</span><span class="p">],[</span><span class="mi">3</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="chvatal_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.chvatal_graph.html#networkx.generators.small.chvatal_graph">[docs]</a><span class="k">def</span> <span class="nf">chvatal_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Chvátal graph."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Chvatal Graph"</span><span class="p">,</span>
<span class="mi">12</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">8</span><span class="p">,</span><span class="mi">10</span><span class="p">],</span>
<span class="p">[</span><span class="mi">6</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">11</span><span class="p">,</span><span class="mi">12</span><span class="p">],[</span><span class="mi">11</span><span class="p">,</span><span class="mi">12</span><span class="p">],[</span><span class="mi">9</span><span class="p">,</span><span class="mi">12</span><span class="p">],</span>
<span class="p">[</span><span class="mi">11</span><span class="p">],[</span><span class="mi">11</span><span class="p">,</span><span class="mi">12</span><span class="p">],[],[]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="cubical_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.cubical_graph.html#networkx.generators.small.cubical_graph">[docs]</a><span class="k">def</span> <span class="nf">cubical_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the 3-regular Platonic Cubical graph."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Platonic Cubical Graph"</span><span class="p">,</span>
<span class="mi">8</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">6</span><span class="p">],</span>
<span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="desargues_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.desargues_graph.html#networkx.generators.small.desargues_graph">[docs]</a><span class="k">def</span> <span class="nf">desargues_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">""" Return the Desargues graph."""</span>
<span class="n">G</span><span class="o">=</span><span class="n">LCF_graph</span><span class="p">(</span><span class="mi">20</span><span class="p">,</span> <span class="p">[</span><span class="mi">5</span><span class="p">,</span><span class="o">-</span><span class="mi">5</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="o">-</span><span class="mi">9</span><span class="p">],</span> <span class="mi">5</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Desargues Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="diamond_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.diamond_graph.html#networkx.generators.small.diamond_graph">[docs]</a><span class="k">def</span> <span class="nf">diamond_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Diamond graph. """</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Diamond Graph"</span><span class="p">,</span>
<span class="mi">4</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="dodecahedral_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.dodecahedral_graph.html#networkx.generators.small.dodecahedral_graph">[docs]</a><span class="k">def</span> <span class="nf">dodecahedral_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">""" Return the Platonic Dodecahedral graph. """</span>
<span class="n">G</span><span class="o">=</span><span class="n">LCF_graph</span><span class="p">(</span><span class="mi">20</span><span class="p">,</span> <span class="p">[</span><span class="mi">10</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="o">-</span><span class="mi">4</span><span class="p">,</span><span class="o">-</span><span class="mi">7</span><span class="p">,</span><span class="mi">10</span><span class="p">,</span><span class="o">-</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="o">-</span><span class="mi">7</span><span class="p">,</span><span class="mi">4</span><span class="p">],</span> <span class="mi">2</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Dodecahedral Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="frucht_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.frucht_graph.html#networkx.generators.small.frucht_graph">[docs]</a><span class="k">def</span> <span class="nf">frucht_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Frucht Graph.</span>
<span class="sd"> The Frucht Graph is the smallest cubical graph whose</span>
<span class="sd"> automorphism group consists only of the identity element.</span>
<span class="sd"> """</span>
<span class="n">G</span><span class="o">=</span><span class="n">cycle_graph</span><span class="p">(</span><span class="mi">7</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([[</span><span class="mi">0</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">6</span><span class="p">,</span><span class="mi">10</span><span class="p">],</span>
<span class="p">[</span><span class="mi">7</span><span class="p">,</span><span class="mi">11</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">11</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">10</span><span class="p">,</span><span class="mi">11</span><span class="p">]])</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Frucht Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="heawood_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.heawood_graph.html#networkx.generators.small.heawood_graph">[docs]</a><span class="k">def</span> <span class="nf">heawood_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">""" Return the Heawood graph, a (3,6) cage. """</span>
<span class="n">G</span><span class="o">=</span><span class="n">LCF_graph</span><span class="p">(</span><span class="mi">14</span><span class="p">,</span> <span class="p">[</span><span class="mi">5</span><span class="p">,</span><span class="o">-</span><span class="mi">5</span><span class="p">],</span> <span class="mi">7</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Heawood Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="house_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.house_graph.html#networkx.generators.small.house_graph">[docs]</a><span class="k">def</span> <span class="nf">house_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the House graph (square with triangle on top)."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"House Graph"</span><span class="p">,</span>
<span class="mi">5</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="house_x_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.house_x_graph.html#networkx.generators.small.house_x_graph">[docs]</a><span class="k">def</span> <span class="nf">house_x_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the House graph with a cross inside the house square."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"House-with-X-inside Graph"</span><span class="p">,</span>
<span class="mi">5</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="icosahedral_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.icosahedral_graph.html#networkx.generators.small.icosahedral_graph">[docs]</a><span class="k">def</span> <span class="nf">icosahedral_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Platonic Icosahedral graph."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Platonic Icosahedral Graph"</span><span class="p">,</span>
<span class="mi">12</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">8</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="mi">12</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">10</span><span class="p">,</span><span class="mi">11</span><span class="p">],</span>
<span class="p">[</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">11</span><span class="p">,</span><span class="mi">12</span><span class="p">],[</span><span class="mi">7</span><span class="p">,</span><span class="mi">12</span><span class="p">],[],[</span><span class="mi">9</span><span class="p">,</span><span class="mi">10</span><span class="p">,</span><span class="mi">11</span><span class="p">,</span><span class="mi">12</span><span class="p">],</span>
<span class="p">[</span><span class="mi">10</span><span class="p">],[</span><span class="mi">11</span><span class="p">],[</span><span class="mi">12</span><span class="p">],[]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="krackhardt_kite_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.krackhardt_kite_graph.html#networkx.generators.small.krackhardt_kite_graph">[docs]</a><span class="k">def</span> <span class="nf">krackhardt_kite_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Return the Krackhardt Kite Social Network.</span>
<span class="sd"> </span>
<span class="sd"> A 10 actor social network introduced by David Krackhardt</span>
<span class="sd"> to illustrate: degree, betweenness, centrality, closeness, etc. </span>
<span class="sd"> The traditional labeling is:</span>
<span class="sd"> Andre=1, Beverley=2, Carol=3, Diane=4,</span>
<span class="sd"> Ed=5, Fernando=6, Garth=7, Heather=8, Ike=9, Jane=10.</span>
<span class="sd"> </span>
<span class="sd"> """</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Krackhardt Kite Social Network"</span><span class="p">,</span>
<span class="mi">10</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">],</span>
<span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">9</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="moebius_kantor_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.moebius_kantor_graph.html#networkx.generators.small.moebius_kantor_graph">[docs]</a><span class="k">def</span> <span class="nf">moebius_kantor_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Moebius-Kantor graph."""</span>
<span class="n">G</span><span class="o">=</span><span class="n">LCF_graph</span><span class="p">(</span><span class="mi">16</span><span class="p">,</span> <span class="p">[</span><span class="mi">5</span><span class="p">,</span><span class="o">-</span><span class="mi">5</span><span class="p">],</span> <span class="mi">8</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Moebius-Kantor Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="octahedral_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.octahedral_graph.html#networkx.generators.small.octahedral_graph">[docs]</a><span class="k">def</span> <span class="nf">octahedral_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Platonic Octahedral graph."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Platonic Octahedral Graph"</span><span class="p">,</span>
<span class="mi">6</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">6</span><span class="p">],[]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="pappus_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.pappus_graph.html#networkx.generators.small.pappus_graph">[docs]</a><span class="k">def</span> <span class="nf">pappus_graph</span><span class="p">():</span>
<span class="sd">""" Return the Pappus graph."""</span>
<span class="n">G</span><span class="o">=</span><span class="n">LCF_graph</span><span class="p">(</span><span class="mi">18</span><span class="p">,[</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="o">-</span><span class="mi">7</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="o">-</span><span class="mi">7</span><span class="p">,</span><span class="o">-</span><span class="mi">5</span><span class="p">],</span><span class="mi">3</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Pappus Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="petersen_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.petersen_graph.html#networkx.generators.small.petersen_graph">[docs]</a><span class="k">def</span> <span class="nf">petersen_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Petersen graph."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Petersen Graph"</span><span class="p">,</span>
<span class="mi">10</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">8</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="mi">10</span><span class="p">],</span>
<span class="p">[</span><span class="mi">3</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">8</span><span class="p">]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="sedgewick_maze_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.sedgewick_maze_graph.html#networkx.generators.small.sedgewick_maze_graph">[docs]</a><span class="k">def</span> <span class="nf">sedgewick_maze_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Return a small maze with a cycle.</span>
<span class="sd"> This is the maze used in Sedgewick,3rd Edition, Part 5, Graph</span>
<span class="sd"> Algorithms, Chapter 18, e.g. Figure 18.2 and following.</span>
<span class="sd"> Nodes are numbered 0,..,7</span>
<span class="sd"> """</span>
<span class="n">G</span><span class="o">=</span><span class="n">empty_graph</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_nodes_from</span><span class="p">(</span><span class="nb">range</span><span class="p">(</span><span class="mi">8</span><span class="p">))</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([[</span><span class="mi">0</span><span class="p">,</span><span class="mi">2</span><span class="p">],[</span><span class="mi">0</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">0</span><span class="p">,</span><span class="mi">5</span><span class="p">]])</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([[</span><span class="mi">1</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">6</span><span class="p">]])</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([[</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">]])</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([[</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">6</span><span class="p">]])</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Sedgewick Maze"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="tetrahedral_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.tetrahedral_graph.html#networkx.generators.small.tetrahedral_graph">[docs]</a><span class="k">def</span> <span class="nf">tetrahedral_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">""" Return the 3-regular Platonic Tetrahedral graph."""</span>
<span class="n">G</span><span class="o">=</span><span class="n">complete_graph</span><span class="p">(</span><span class="mi">4</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Platonic Tetrahedral graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="truncated_cube_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.truncated_cube_graph.html#networkx.generators.small.truncated_cube_graph">[docs]</a><span class="k">def</span> <span class="nf">truncated_cube_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the skeleton of the truncated cube."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Truncated Cube Graph"</span><span class="p">,</span>
<span class="mi">24</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">12</span><span class="p">,</span><span class="mi">15</span><span class="p">],[</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">],</span>
<span class="p">[</span><span class="mi">6</span><span class="p">],[</span><span class="mi">17</span><span class="p">,</span><span class="mi">19</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">11</span><span class="p">,</span><span class="mi">13</span><span class="p">],</span>
<span class="p">[</span><span class="mi">10</span><span class="p">],[</span><span class="mi">18</span><span class="p">,</span><span class="mi">21</span><span class="p">],[</span><span class="mi">12</span><span class="p">,</span><span class="mi">13</span><span class="p">],[</span><span class="mi">15</span><span class="p">],</span>
<span class="p">[</span><span class="mi">14</span><span class="p">],[</span><span class="mi">22</span><span class="p">,</span><span class="mi">23</span><span class="p">],[</span><span class="mi">16</span><span class="p">],[</span><span class="mi">20</span><span class="p">,</span><span class="mi">24</span><span class="p">],</span>
<span class="p">[</span><span class="mi">18</span><span class="p">,</span><span class="mi">19</span><span class="p">],[</span><span class="mi">21</span><span class="p">],[</span><span class="mi">20</span><span class="p">],[</span><span class="mi">24</span><span class="p">],</span>
<span class="p">[</span><span class="mi">22</span><span class="p">],[</span><span class="mi">23</span><span class="p">],[</span><span class="mi">24</span><span class="p">],[]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="truncated_tetrahedron_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.truncated_tetrahedron_graph.html#networkx.generators.small.truncated_tetrahedron_graph">[docs]</a><span class="k">def</span> <span class="nf">truncated_tetrahedron_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the skeleton of the truncated Platonic tetrahedron."""</span>
<span class="n">G</span><span class="o">=</span><span class="n">path_graph</span><span class="p">(</span><span class="mi">12</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="c"># G.add_edges_from([(1,3),(1,10),(2,7),(4,12),(5,12),(6,8),(9,11)])</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([(</span><span class="mi">0</span><span class="p">,</span><span class="mi">2</span><span class="p">),(</span><span class="mi">0</span><span class="p">,</span><span class="mi">9</span><span class="p">),(</span><span class="mi">1</span><span class="p">,</span><span class="mi">6</span><span class="p">),(</span><span class="mi">3</span><span class="p">,</span><span class="mi">11</span><span class="p">),(</span><span class="mi">4</span><span class="p">,</span><span class="mi">11</span><span class="p">),(</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">),(</span><span class="mi">8</span><span class="p">,</span><span class="mi">10</span><span class="p">)])</span>
<span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">=</span><span class="s">"Truncated Tetrahedron Graph"</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<div class="viewcode-block" id="tutte_graph"><a class="viewcode-back" href="../../../reference/generated/networkx.generators.small.tutte_graph.html#networkx.generators.small.tutte_graph">[docs]</a><span class="k">def</span> <span class="nf">tutte_graph</span><span class="p">(</span><span class="n">create_using</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Return the Tutte graph."""</span>
<span class="n">description</span><span class="o">=</span><span class="p">[</span>
<span class="s">"adjacencylist"</span><span class="p">,</span>
<span class="s">"Tutte's Graph"</span><span class="p">,</span>
<span class="mi">46</span><span class="p">,</span>
<span class="p">[[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">27</span><span class="p">],[</span><span class="mi">11</span><span class="p">,</span><span class="mi">12</span><span class="p">],[</span><span class="mi">19</span><span class="p">,</span><span class="mi">20</span><span class="p">],[</span><span class="mi">6</span><span class="p">,</span><span class="mi">34</span><span class="p">],</span>
<span class="p">[</span><span class="mi">7</span><span class="p">,</span><span class="mi">30</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">28</span><span class="p">],[</span><span class="mi">9</span><span class="p">,</span><span class="mi">15</span><span class="p">],[</span><span class="mi">10</span><span class="p">,</span><span class="mi">39</span><span class="p">],[</span><span class="mi">11</span><span class="p">,</span><span class="mi">38</span><span class="p">],</span>
<span class="p">[</span><span class="mi">40</span><span class="p">],[</span><span class="mi">13</span><span class="p">,</span><span class="mi">40</span><span class="p">],[</span><span class="mi">14</span><span class="p">,</span><span class="mi">36</span><span class="p">],[</span><span class="mi">15</span><span class="p">,</span><span class="mi">16</span><span class="p">],[</span><span class="mi">35</span><span class="p">],</span>
<span class="p">[</span><span class="mi">17</span><span class="p">,</span><span class="mi">23</span><span class="p">],[</span><span class="mi">18</span><span class="p">,</span><span class="mi">45</span><span class="p">],[</span><span class="mi">19</span><span class="p">,</span><span class="mi">44</span><span class="p">],[</span><span class="mi">46</span><span class="p">],[</span><span class="mi">21</span><span class="p">,</span><span class="mi">46</span><span class="p">],</span>
<span class="p">[</span><span class="mi">22</span><span class="p">,</span><span class="mi">42</span><span class="p">],[</span><span class="mi">23</span><span class="p">,</span><span class="mi">24</span><span class="p">],[</span><span class="mi">41</span><span class="p">],[</span><span class="mi">25</span><span class="p">,</span><span class="mi">28</span><span class="p">],[</span><span class="mi">26</span><span class="p">,</span><span class="mi">33</span><span class="p">],</span>
<span class="p">[</span><span class="mi">27</span><span class="p">,</span><span class="mi">32</span><span class="p">],[</span><span class="mi">34</span><span class="p">],[</span><span class="mi">29</span><span class="p">],[</span><span class="mi">30</span><span class="p">,</span><span class="mi">33</span><span class="p">],[</span><span class="mi">31</span><span class="p">],</span>
<span class="p">[</span><span class="mi">32</span><span class="p">,</span><span class="mi">34</span><span class="p">],[</span><span class="mi">33</span><span class="p">],[],[],[</span><span class="mi">36</span><span class="p">,</span><span class="mi">39</span><span class="p">],</span>
<span class="p">[</span><span class="mi">37</span><span class="p">],[</span><span class="mi">38</span><span class="p">,</span><span class="mi">40</span><span class="p">],[</span><span class="mi">39</span><span class="p">],[],[],</span>
<span class="p">[</span><span class="mi">42</span><span class="p">,</span><span class="mi">45</span><span class="p">],[</span><span class="mi">43</span><span class="p">],[</span><span class="mi">44</span><span class="p">,</span><span class="mi">46</span><span class="p">],[</span><span class="mi">45</span><span class="p">],[],[]]</span>
<span class="p">]</span>
<span class="n">G</span><span class="o">=</span><span class="n">make_small_undirected_graph</span><span class="p">(</span><span class="n">description</span><span class="p">,</span> <span class="n">create_using</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</pre></div></div>
</div>
</div>
</div>
<div class="clearer"></div>
</div>
<div class="related">
<h3>Navigation</h3>
<ul>
<li class="right" style="margin-right: 10px">
<a href="../../../genindex.html" title="General Index"
>index</a></li>
<li class="right" >
<a href="../../../py-modindex.html" title="Python Module Index"
>modules</a> |</li>
<li><a href="http://networkx.github.com/">NetworkX Home </a> | </li>
<li><a href="http://networkx.github.com/documentation.html">Documentation </a>| </li>
<li><a href="http://networkx.github.com/download.html">Download </a> | </li>
<li><a href="http://github.com/networkx">Developer (Github)</a></li>
<li><a href="../../index.html" >Module code</a> »</li>
<li><a href="../../networkx.html" >networkx</a> »</li>
</ul>
</div>
<div class="footer">
© Copyright 2013, NetworkX Developers.
Last updated on Oct 23, 2013.
Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3.
</div>
</body>
</html>
