<!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.readwrite.pajek — 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.readwrite.pajek</h1><div class="highlight"><pre>
<span class="sd">"""</span>
<span class="sd">*****</span>
<span class="sd">Pajek</span>
<span class="sd">*****</span>
<span class="sd">Read graphs in Pajek format.</span>
<span class="sd">This implementation handles directed and undirected graphs including</span>
<span class="sd">those with self loops and parallel edges. </span>
<span class="sd">Format</span>
<span class="sd">------</span>
<span class="sd">See http://vlado.fmf.uni-lj.si/pub/networks/pajek/doc/draweps.htm</span>
<span class="sd">for format information.</span>
<span class="sd">"""</span>
<span class="c"># Copyright (C) 2008-2011 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="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.utils</span> <span class="kn">import</span> <span class="n">is_string_like</span><span class="p">,</span> <span class="n">open_file</span><span class="p">,</span> <span class="n">make_str</span>
<span class="n">__author__</span> <span class="o">=</span> <span class="s">"""Aric Hagberg (hagberg@lanl.gov)"""</span>
<span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s">'read_pajek'</span><span class="p">,</span> <span class="s">'parse_pajek'</span><span class="p">,</span> <span class="s">'generate_pajek'</span><span class="p">,</span> <span class="s">'write_pajek'</span><span class="p">]</span>
<span class="k">def</span> <span class="nf">generate_pajek</span><span class="p">(</span><span class="n">G</span><span class="p">):</span>
<span class="sd">"""Generate lines in Pajek graph format.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> G : graph</span>
<span class="sd"> A Networkx graph</span>
<span class="sd"> References</span>
<span class="sd"> ----------</span>
<span class="sd"> See http://vlado.fmf.uni-lj.si/pub/networks/pajek/doc/draweps.htm</span>
<span class="sd"> for format information.</span>
<span class="sd"> """</span>
<span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">name</span><span class="o">==</span><span class="s">''</span><span class="p">:</span>
<span class="n">name</span><span class="o">=</span><span class="s">'NetworkX'</span>
<span class="k">else</span><span class="p">:</span>
<span class="n">name</span><span class="o">=</span><span class="n">G</span><span class="o">.</span><span class="n">name</span>
<span class="c"># Apparently many Pajek format readers can't process this line</span>
<span class="c"># So we'll leave it out for now.</span>
<span class="c"># yield '*network %s'%name</span>
<span class="c"># write nodes with attributes</span>
<span class="k">yield</span> <span class="s">'*vertices </span><span class="si">%s</span><span class="s">'</span><span class="o">%</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">order</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="c"># make dictionary mapping nodes to integers</span>
<span class="n">nodenumber</span><span class="o">=</span><span class="nb">dict</span><span class="p">(</span><span class="nb">zip</span><span class="p">(</span><span class="n">nodes</span><span class="p">,</span><span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="nb">len</span><span class="p">(</span><span class="n">nodes</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">)))</span>
<span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">nodes</span><span class="p">:</span>
<span class="n">na</span><span class="o">=</span><span class="n">G</span><span class="o">.</span><span class="n">node</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">n</span><span class="p">,{})</span>
<span class="n">x</span><span class="o">=</span><span class="n">na</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="s">'x'</span><span class="p">,</span><span class="mf">0.0</span><span class="p">)</span>
<span class="n">y</span><span class="o">=</span><span class="n">na</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="s">'y'</span><span class="p">,</span><span class="mf">0.0</span><span class="p">)</span>
<span class="nb">id</span><span class="o">=</span><span class="nb">int</span><span class="p">(</span><span class="n">na</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="s">'id'</span><span class="p">,</span><span class="n">nodenumber</span><span class="p">[</span><span class="n">n</span><span class="p">]))</span>
<span class="n">nodenumber</span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="o">=</span><span class="nb">id</span>
<span class="n">shape</span><span class="o">=</span><span class="n">na</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="s">'shape'</span><span class="p">,</span><span class="s">'ellipse'</span><span class="p">)</span>
<span class="n">s</span><span class="o">=</span><span class="s">' '</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="nb">map</span><span class="p">(</span><span class="n">make_qstr</span><span class="p">,(</span><span class="nb">id</span><span class="p">,</span><span class="n">n</span><span class="p">,</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">,</span><span class="n">shape</span><span class="p">)))</span>
<span class="k">for</span> <span class="n">k</span><span class="p">,</span><span class="n">v</span> <span class="ow">in</span> <span class="n">na</span><span class="o">.</span><span class="n">items</span><span class="p">():</span>
<span class="n">s</span><span class="o">+=</span><span class="s">' </span><span class="si">%s</span><span class="s"> </span><span class="si">%s</span><span class="s">'</span><span class="o">%</span><span class="p">(</span><span class="n">make_qstr</span><span class="p">(</span><span class="n">k</span><span class="p">),</span><span class="n">make_qstr</span><span class="p">(</span><span class="n">v</span><span class="p">))</span>
<span class="k">yield</span> <span class="n">s</span>
<span class="c"># write edges with attributes </span>
<span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span>
<span class="k">yield</span> <span class="s">'*arcs'</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="s">'*edges'</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">v</span><span class="p">,</span><span class="n">edgedata</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">data</span><span class="o">=</span><span class="bp">True</span><span class="p">):</span>
<span class="n">d</span><span class="o">=</span><span class="n">edgedata</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span>
<span class="n">value</span><span class="o">=</span><span class="n">d</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="s">'weight'</span><span class="p">,</span><span class="mf">1.0</span><span class="p">)</span> <span class="c"># use 1 as default edge value</span>
<span class="n">s</span><span class="o">=</span><span class="s">' '</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="nb">map</span><span class="p">(</span><span class="n">make_qstr</span><span class="p">,(</span><span class="n">nodenumber</span><span class="p">[</span><span class="n">u</span><span class="p">],</span><span class="n">nodenumber</span><span class="p">[</span><span class="n">v</span><span class="p">],</span><span class="n">value</span><span class="p">)))</span>
<span class="k">for</span> <span class="n">k</span><span class="p">,</span><span class="n">v</span> <span class="ow">in</span> <span class="n">d</span><span class="o">.</span><span class="n">items</span><span class="p">():</span>
<span class="n">s</span><span class="o">+=</span><span class="s">' </span><span class="si">%s</span><span class="s"> </span><span class="si">%s</span><span class="s">'</span><span class="o">%</span><span class="p">(</span><span class="n">make_qstr</span><span class="p">(</span><span class="n">k</span><span class="p">),</span><span class="n">make_qstr</span><span class="p">(</span><span class="n">v</span><span class="p">))</span>
<span class="n">s</span><span class="o">+=</span><span class="s">' </span><span class="si">%s</span><span class="s"> </span><span class="si">%s</span><span class="s">'</span><span class="o">%</span><span class="p">(</span><span class="n">k</span><span class="p">,</span><span class="n">v</span><span class="p">)</span>
<span class="k">yield</span> <span class="n">s</span>
<span class="nd">@open_file</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">mode</span><span class="o">=</span><span class="s">'wb'</span><span class="p">)</span>
<div class="viewcode-block" id="write_pajek"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.pajek.write_pajek.html#networkx.readwrite.pajek.write_pajek">[docs]</a><span class="k">def</span> <span class="nf">write_pajek</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">path</span><span class="p">,</span> <span class="n">encoding</span><span class="o">=</span><span class="s">'UTF-8'</span><span class="p">):</span>
<span class="sd">"""Write graph in Pajek format to path.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> G : graph</span>
<span class="sd"> A Networkx graph</span>
<span class="sd"> path : file or string</span>
<span class="sd"> File or filename to write. </span>
<span class="sd"> Filenames ending in .gz or .bz2 will be compressed.</span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> >>> G=nx.path_graph(4)</span>
<span class="sd"> >>> nx.write_pajek(G, "test.net")</span>
<span class="sd"> References</span>
<span class="sd"> ----------</span>
<span class="sd"> See http://vlado.fmf.uni-lj.si/pub/networks/pajek/doc/draweps.htm</span>
<span class="sd"> for format information.</span>
<span class="sd"> """</span>
<span class="k">for</span> <span class="n">line</span> <span class="ow">in</span> <span class="n">generate_pajek</span><span class="p">(</span><span class="n">G</span><span class="p">):</span>
<span class="n">line</span><span class="o">+=</span><span class="s">'</span><span class="se">\n</span><span class="s">'</span>
<span class="n">path</span><span class="o">.</span><span class="n">write</span><span class="p">(</span><span class="n">line</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">encoding</span><span class="p">))</span>
</div>
<span class="nd">@open_file</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="n">mode</span><span class="o">=</span><span class="s">'rb'</span><span class="p">)</span>
<div class="viewcode-block" id="read_pajek"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.pajek.read_pajek.html#networkx.readwrite.pajek.read_pajek">[docs]</a><span class="k">def</span> <span class="nf">read_pajek</span><span class="p">(</span><span class="n">path</span><span class="p">,</span><span class="n">encoding</span><span class="o">=</span><span class="s">'UTF-8'</span><span class="p">):</span>
<span class="sd">"""Read graph in Pajek format from path. </span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> path : file or string</span>
<span class="sd"> File or filename to write. </span>
<span class="sd"> Filenames ending in .gz or .bz2 will be uncompressed.</span>
<span class="sd"> Returns</span>
<span class="sd"> -------</span>
<span class="sd"> G : NetworkX MultiGraph or MultiDiGraph.</span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> >>> G=nx.path_graph(4)</span>
<span class="sd"> >>> nx.write_pajek(G, "test.net")</span>
<span class="sd"> >>> G=nx.read_pajek("test.net")</span>
<span class="sd"> To create a Graph instead of a MultiGraph use</span>
<span class="sd"> >>> G1=nx.Graph(G)</span>
<span class="sd"> References</span>
<span class="sd"> ----------</span>
<span class="sd"> See http://vlado.fmf.uni-lj.si/pub/networks/pajek/doc/draweps.htm</span>
<span class="sd"> for format information.</span>
<span class="sd"> """</span>
<span class="n">lines</span> <span class="o">=</span> <span class="p">(</span><span class="n">line</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">encoding</span><span class="p">)</span> <span class="k">for</span> <span class="n">line</span> <span class="ow">in</span> <span class="n">path</span><span class="p">)</span>
<span class="k">return</span> <span class="n">parse_pajek</span><span class="p">(</span><span class="n">lines</span><span class="p">)</span>
</div>
<div class="viewcode-block" id="parse_pajek"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.pajek.parse_pajek.html#networkx.readwrite.pajek.parse_pajek">[docs]</a><span class="k">def</span> <span class="nf">parse_pajek</span><span class="p">(</span><span class="n">lines</span><span class="p">):</span>
<span class="sd">"""Parse Pajek format graph from string or iterable.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> lines : string or iterable</span>
<span class="sd"> Data in Pajek format.</span>
<span class="sd"> Returns</span>
<span class="sd"> -------</span>
<span class="sd"> G : NetworkX graph</span>
<span class="sd"> See Also</span>
<span class="sd"> --------</span>
<span class="sd"> read_pajek()</span>
<span class="sd"> """</span>
<span class="kn">import</span> <span class="nn">shlex</span>
<span class="c"># multigraph=False</span>
<span class="k">if</span> <span class="n">is_string_like</span><span class="p">(</span><span class="n">lines</span><span class="p">):</span> <span class="n">lines</span><span class="o">=</span><span class="nb">iter</span><span class="p">(</span><span class="n">lines</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="s">'</span><span class="se">\n</span><span class="s">'</span><span class="p">))</span>
<span class="n">lines</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">([</span><span class="n">line</span><span class="o">.</span><span class="n">rstrip</span><span class="p">(</span><span class="s">'</span><span class="se">\n</span><span class="s">'</span><span class="p">)</span> <span class="k">for</span> <span class="n">line</span> <span class="ow">in</span> <span class="n">lines</span><span class="p">])</span>
<span class="n">G</span><span class="o">=</span><span class="n">nx</span><span class="o">.</span><span class="n">MultiDiGraph</span><span class="p">()</span> <span class="c"># are multiedges allowed in Pajek? assume yes</span>
<span class="k">while</span> <span class="n">lines</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">l</span><span class="o">=</span><span class="nb">next</span><span class="p">(</span><span class="n">lines</span><span class="p">)</span>
<span class="k">except</span><span class="p">:</span> <span class="c">#EOF</span>
<span class="k">break</span>
<span class="k">if</span> <span class="n">l</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span><span class="o">.</span><span class="n">startswith</span><span class="p">(</span><span class="s">"*network"</span><span class="p">):</span>
<span class="n">label</span><span class="p">,</span><span class="n">name</span><span class="o">=</span><span class="n">l</span><span class="o">.</span><span class="n">split</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">if</span> <span class="n">l</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span><span class="o">.</span><span class="n">startswith</span><span class="p">(</span><span class="s">"*vertices"</span><span class="p">):</span>
<span class="n">nodelabels</span><span class="o">=</span><span class="p">{}</span>
<span class="n">l</span><span class="p">,</span><span class="n">nnodes</span><span class="o">=</span><span class="n">l</span><span class="o">.</span><span class="n">split</span><span class="p">()</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="nb">int</span><span class="p">(</span><span class="n">nnodes</span><span class="p">)):</span>
<span class="n">splitline</span><span class="o">=</span><span class="n">shlex</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="nb">str</span><span class="p">(</span><span class="nb">next</span><span class="p">(</span><span class="n">lines</span><span class="p">)))</span>
<span class="nb">id</span><span class="p">,</span><span class="n">label</span><span class="o">=</span><span class="n">splitline</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="n">G</span><span class="o">.</span><span class="n">add_node</span><span class="p">(</span><span class="n">label</span><span class="p">)</span>
<span class="n">nodelabels</span><span class="p">[</span><span class="nb">id</span><span class="p">]</span><span class="o">=</span><span class="n">label</span>
<span class="n">G</span><span class="o">.</span><span class="n">node</span><span class="p">[</span><span class="n">label</span><span class="p">]</span><span class="o">=</span><span class="p">{</span><span class="s">'id'</span><span class="p">:</span><span class="nb">id</span><span class="p">}</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">,</span><span class="n">shape</span><span class="o">=</span><span class="n">splitline</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="n">G</span><span class="o">.</span><span class="n">node</span><span class="p">[</span><span class="n">label</span><span class="p">]</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s">'x'</span><span class="p">:</span><span class="nb">float</span><span class="p">(</span><span class="n">x</span><span class="p">),</span>
<span class="s">'y'</span><span class="p">:</span><span class="nb">float</span><span class="p">(</span><span class="n">y</span><span class="p">),</span>
<span class="s">'shape'</span><span class="p">:</span><span class="n">shape</span><span class="p">})</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">pass</span>
<span class="n">extra_attr</span><span class="o">=</span><span class="nb">zip</span><span class="p">(</span><span class="n">splitline</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="n">splitline</span><span class="p">[</span><span class="mi">6</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">node</span><span class="p">[</span><span class="n">label</span><span class="p">]</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">extra_attr</span><span class="p">)</span>
<span class="k">if</span> <span class="n">l</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span><span class="o">.</span><span class="n">startswith</span><span class="p">(</span><span class="s">"*edges"</span><span class="p">)</span> <span class="ow">or</span> <span class="n">l</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span><span class="o">.</span><span class="n">startswith</span><span class="p">(</span><span class="s">"*arcs"</span><span class="p">):</span>
<span class="k">if</span> <span class="n">l</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span><span class="o">.</span><span class="n">startswith</span><span class="p">(</span><span class="s">"*edge"</span><span class="p">):</span>
<span class="c"># switch from multidigraph to multigraph</span>
<span class="n">G</span><span class="o">=</span><span class="n">nx</span><span class="o">.</span><span class="n">MultiGraph</span><span class="p">(</span><span class="n">G</span><span class="p">)</span>
<span class="k">if</span> <span class="n">l</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span><span class="o">.</span><span class="n">startswith</span><span class="p">(</span><span class="s">"*arcs"</span><span class="p">):</span>
<span class="c"># switch to directed with multiple arcs for each existing edge</span>
<span class="n">G</span><span class="o">=</span><span class="n">G</span><span class="o">.</span><span class="n">to_directed</span><span class="p">()</span>
<span class="k">for</span> <span class="n">l</span> <span class="ow">in</span> <span class="n">lines</span><span class="p">:</span>
<span class="n">splitline</span><span class="o">=</span><span class="n">shlex</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="nb">str</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">splitline</span><span class="p">)</span><span class="o"><</span><span class="mi">2</span><span class="p">:</span>
<span class="k">continue</span>
<span class="n">ui</span><span class="p">,</span><span class="n">vi</span><span class="o">=</span><span class="n">splitline</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="n">u</span><span class="o">=</span><span class="n">nodelabels</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">ui</span><span class="p">,</span><span class="n">ui</span><span class="p">)</span>
<span class="n">v</span><span class="o">=</span><span class="n">nodelabels</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">vi</span><span class="p">,</span><span class="n">vi</span><span class="p">)</span>
<span class="c"># parse the data attached to this edge and put in a dictionary </span>
<span class="n">edge_data</span><span class="o">=</span><span class="p">{}</span>
<span class="k">try</span><span class="p">:</span>
<span class="c"># there should always be a single value on the edge?</span>
<span class="n">w</span><span class="o">=</span><span class="n">splitline</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="n">edge_data</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s">'weight'</span><span class="p">:</span><span class="nb">float</span><span class="p">(</span><span class="n">w</span><span class="p">[</span><span class="mi">0</span><span class="p">])})</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">pass</span>
<span class="c"># if there isn't, just assign a 1</span>
<span class="c"># edge_data.update({'value':1})</span>
<span class="n">extra_attr</span><span class="o">=</span><span class="nb">zip</span><span class="p">(</span><span class="n">splitline</span><span class="p">[</span><span class="mi">3</span><span class="p">::</span><span class="mi">2</span><span class="p">],</span><span class="n">splitline</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">edge_data</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">extra_attr</span><span class="p">)</span>
<span class="c"># if G.has_edge(u,v):</span>
<span class="c"># multigraph=True</span>
<span class="n">G</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">u</span><span class="p">,</span><span class="n">v</span><span class="p">,</span><span class="o">**</span><span class="n">edge_data</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</span>
</div>
<span class="k">def</span> <span class="nf">make_qstr</span><span class="p">(</span><span class="n">t</span><span class="p">):</span>
<span class="sd">"""Return the string representation of t. </span>
<span class="sd"> Add outer double-quotes if the string has a space.</span>
<span class="sd"> """</span>
<span class="k">if</span> <span class="ow">not</span> <span class="n">is_string_like</span><span class="p">(</span><span class="n">t</span><span class="p">):</span>
<span class="n">t</span> <span class="o">=</span> <span class="nb">str</span><span class="p">(</span><span class="n">t</span><span class="p">)</span>
<span class="k">if</span> <span class="s">" "</span> <span class="ow">in</span> <span class="n">t</span><span class="p">:</span>
<span class="n">t</span><span class="o">=</span><span class="s">r'"</span><span class="si">%s</span><span class="s">"'</span><span class="o">%</span><span class="n">t</span>
<span class="k">return</span> <span class="n">t</span>
<span class="c"># fixture for nose tests</span>
<span class="k">def</span> <span class="nf">teardown_module</span><span class="p">(</span><span class="n">module</span><span class="p">):</span>
<span class="kn">import</span> <span class="nn">os</span>
<span class="n">os</span><span class="o">.</span><span class="n">unlink</span><span class="p">(</span><span class="s">'test.net'</span><span class="p">)</span>
</pre></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>
