<!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>degree — 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="MultiDiGraph - Directed graphs with self loops and parallel edges" href="../classes.multidigraph.html" /> <link rel="next" title="degree_iter" href="networkx.MultiDiGraph.degree_iter.html" /> <link rel="prev" title="__len__" href="networkx.MultiDiGraph.__len__.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 class="right" > <a href="networkx.MultiDiGraph.degree_iter.html" title="degree_iter" accesskey="N">next</a> |</li> <li class="right" > <a href="networkx.MultiDiGraph.__len__.html" title="__len__" accesskey="P">previous</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" >Reference</a> »</li> <li><a href="../pdf_reference.html" >Reference</a> »</li> <li><a href="../classes.html" >Graph types</a> »</li> <li><a href="../classes.multidigraph.html" accesskey="U">MultiDiGraph - Directed graphs with self loops and parallel edges</a> »</li> </ul> </div> <div class="sphinxsidebar"> <div class="sphinxsidebarwrapper"> <h4>Previous topic</h4> <p class="topless"><a href="networkx.MultiDiGraph.__len__.html" title="previous chapter">__len__</a></p> <h4>Next topic</h4> <p class="topless"><a href="networkx.MultiDiGraph.degree_iter.html" title="next chapter">degree_iter</a></p> <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"> <div class="section" id="degree"> <h1>degree<a class="headerlink" href="#degree" title="Permalink to this headline">¶</a></h1> <dl class="method"> <dt id="networkx.MultiDiGraph.degree"> <tt class="descclassname">MultiDiGraph.</tt><tt class="descname">degree</tt><big>(</big><em>nbunch=None</em>, <em>weight=None</em><big>)</big><a class="headerlink" href="#networkx.MultiDiGraph.degree" title="Permalink to this definition">¶</a></dt> <dd><p>Return the degree of a node or nodes.</p> <p>The node degree is the number of edges adjacent to that node.</p> <table class="docutils field-list" frame="void" rules="none"> <col class="field-name" /> <col class="field-body" /> <tbody valign="top"> <tr class="field-odd field"><th class="field-name">Parameters :</th><td class="field-body"><p class="first"><strong>nbunch</strong> : iterable container, optional (default=all nodes)</p> <blockquote> <div><p>A container of nodes. The container will be iterated through once.</p> </div></blockquote> <p><strong>weight</strong> : string or None, optional (default=None)</p> <blockquote> <div><p>The edge attribute that holds the numerical value used as a weight. If None, then each edge has weight 1. The degree is the sum of the edge weights adjacent to the node.</p> </div></blockquote> </td> </tr> <tr class="field-even field"><th class="field-name">Returns :</th><td class="field-body"><p class="first"><strong>nd</strong> : dictionary, or number</p> <blockquote class="last"> <div><p>A dictionary with nodes as keys and degree as values or a number if a single node is specified.</p> </div></blockquote> </td> </tr> </tbody> </table> <p class="rubric">Examples</p> <div class="highlight-python"><div class="highlight"><pre><span class="gp">>>> </span><span class="n">G</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">Graph</span><span class="p">()</span> <span class="c"># or DiGraph, MultiGraph, MultiDiGraph, etc</span> <span class="gp">>>> </span><span class="n">G</span><span class="o">.</span><span class="n">add_path</span><span class="p">([</span><span class="mi">0</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="gp">>>> </span><span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span> <span class="go">1</span> <span class="gp">>>> </span><span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">([</span><span class="mi">0</span><span class="p">,</span><span class="mi">1</span><span class="p">])</span> <span class="go">{0: 1, 1: 2}</span> <span class="gp">>>> </span><span class="nb">list</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">([</span><span class="mi">0</span><span class="p">,</span><span class="mi">1</span><span class="p">])</span><span class="o">.</span><span class="n">values</span><span class="p">())</span> <span class="go">[1, 2]</span> </pre></div> </div> </dd></dl> </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 class="right" > <a href="networkx.MultiDiGraph.degree_iter.html" title="degree_iter" >next</a> |</li> <li class="right" > <a href="networkx.MultiDiGraph.__len__.html" title="__len__" >previous</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" >Reference</a> »</li> <li><a href="../pdf_reference.html" >Reference</a> »</li> <li><a href="../classes.html" >Graph types</a> »</li> <li><a href="../classes.multidigraph.html" >MultiDiGraph - Directed graphs with self loops and parallel edges</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>