<!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.multiline_adjlist — 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.multiline_adjlist</h1><div class="highlight"><pre>
<span class="c"># -*- coding: utf-8 -*-</span>
<span class="sd">"""</span>
<span class="sd">*************************</span>
<span class="sd">Multi-line Adjacency List</span>
<span class="sd">*************************</span>
<span class="sd">Read and write NetworkX graphs as multi-line adjacency lists.</span>
<span class="sd">The multi-line adjacency list format is useful for graphs with </span>
<span class="sd">nodes that can be meaningfully represented as strings. With this format </span>
<span class="sd">simple edge data can be stored but node or graph data is not. </span>
<span class="sd">Format</span>
<span class="sd">------</span>
<span class="sd">The first label in a line is the source node label followed by the node degree</span>
<span class="sd">d. The next d lines are target node labels and optional edge data.</span>
<span class="sd">That pattern repeats for all nodes in the graph.</span>
<span class="sd">The graph with edges a-b, a-c, d-e can be represented as the following </span>
<span class="sd">adjacency list (anything following the # in a line is a comment):: </span>
<span class="sd"> # example.multiline-adjlist</span>
<span class="sd"> a 2</span>
<span class="sd"> b</span>
<span class="sd"> c</span>
<span class="sd"> d 1</span>
<span class="sd"> e</span>
<span class="sd">"""</span>
<span class="n">__author__</span> <span class="o">=</span> <span class="s">'</span><span class="se">\n</span><span class="s">'</span><span class="o">.</span><span class="n">join</span><span class="p">([</span><span class="s">'Aric Hagberg <hagberg@lanl.gov>'</span><span class="p">,</span>
<span class="s">'Dan Schult <dschult@colgate.edu>'</span><span class="p">,</span>
<span class="s">'Loïc Séguin-C. <loicseguin@gmail.com>'</span><span class="p">])</span>
<span class="c"># Copyright (C) 2004-2010 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">'generate_multiline_adjlist'</span><span class="p">,</span>
<span class="s">'write_multiline_adjlist'</span><span class="p">,</span>
<span class="s">'parse_multiline_adjlist'</span><span class="p">,</span>
<span class="s">'read_multiline_adjlist'</span><span class="p">]</span>
<span class="kn">from</span> <span class="nn">networkx.utils</span> <span class="kn">import</span> <span class="n">make_str</span><span class="p">,</span> <span class="n">open_file</span>
<span class="kn">import</span> <span class="nn">networkx</span> <span class="kn">as</span> <span class="nn">nx</span>
<div class="viewcode-block" id="generate_multiline_adjlist"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.multiline_adjlist.generate_multiline_adjlist.html#networkx.readwrite.multiline_adjlist.generate_multiline_adjlist">[docs]</a><span class="k">def</span> <span class="nf">generate_multiline_adjlist</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">delimiter</span> <span class="o">=</span> <span class="s">' '</span><span class="p">):</span>
<span class="sd">"""Generate a single line of the graph G in multiline adjacency list format.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> G : NetworkX graph</span>
<span class="sd"> </span>
<span class="sd"> delimiter : string, optional</span>
<span class="sd"> Separator for node labels </span>
<span class="sd"> Returns</span>
<span class="sd"> -------</span>
<span class="sd"> lines : string</span>
<span class="sd"> Lines of data in multiline adjlist format.</span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> >>> G = nx.lollipop_graph(4, 3)</span>
<span class="sd"> >>> for line in nx.generate_multiline_adjlist(G):</span>
<span class="sd"> ... print(line) </span>
<span class="sd"> 0 3</span>
<span class="sd"> 1 {}</span>
<span class="sd"> 2 {}</span>
<span class="sd"> 3 {}</span>
<span class="sd"> 1 2</span>
<span class="sd"> 2 {}</span>
<span class="sd"> 3 {}</span>
<span class="sd"> 2 1</span>
<span class="sd"> 3 {}</span>
<span class="sd"> 3 1</span>
<span class="sd"> 4 {}</span>
<span class="sd"> 4 1</span>
<span class="sd"> 5 {}</span>
<span class="sd"> 5 1</span>
<span class="sd"> 6 {}</span>
<span class="sd"> 6 0</span>
<span class="sd"> See Also</span>
<span class="sd"> --------</span>
<span class="sd"> write_multiline_adjlist, read_multiline_adjlist</span>
<span class="sd"> """</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">if</span> <span class="n">G</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span>
<span class="k">for</span> <span class="n">s</span><span class="p">,</span><span class="n">nbrs</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">adjacency_iter</span><span class="p">():</span>
<span class="n">nbr_edges</span><span class="o">=</span><span class="p">[</span> <span class="p">(</span><span class="n">u</span><span class="p">,</span><span class="n">data</span><span class="p">)</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">datadict</span> <span class="ow">in</span> <span class="n">nbrs</span><span class="o">.</span><span class="n">items</span><span class="p">()</span>
<span class="k">for</span> <span class="n">key</span><span class="p">,</span><span class="n">data</span> <span class="ow">in</span> <span class="n">datadict</span><span class="o">.</span><span class="n">items</span><span class="p">()]</span>
<span class="n">deg</span><span class="o">=</span><span class="nb">len</span><span class="p">(</span><span class="n">nbr_edges</span><span class="p">)</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">s</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="s">"</span><span class="si">%i</span><span class="s">"</span><span class="o">%</span><span class="p">(</span><span class="n">deg</span><span class="p">)</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">d</span> <span class="ow">in</span> <span class="n">nbr_edges</span><span class="p">:</span>
<span class="k">if</span> <span class="n">d</span> <span class="ow">is</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="n">make_str</span><span class="p">(</span><span class="n">d</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span> <span class="c"># directed single edges</span>
<span class="k">for</span> <span class="n">s</span><span class="p">,</span><span class="n">nbrs</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">adjacency_iter</span><span class="p">():</span>
<span class="n">deg</span><span class="o">=</span><span class="nb">len</span><span class="p">(</span><span class="n">nbrs</span><span class="p">)</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">s</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="s">"</span><span class="si">%i</span><span class="s">"</span><span class="o">%</span><span class="p">(</span><span class="n">deg</span><span class="p">)</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">d</span> <span class="ow">in</span> <span class="n">nbrs</span><span class="o">.</span><span class="n">items</span><span class="p">():</span>
<span class="k">if</span> <span class="n">d</span> <span class="ow">is</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="n">make_str</span><span class="p">(</span><span class="n">d</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span> <span class="c"># undirected</span>
<span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span>
<span class="n">seen</span><span class="o">=</span><span class="nb">set</span><span class="p">()</span> <span class="c"># helper dict used to avoid duplicate edges</span>
<span class="k">for</span> <span class="n">s</span><span class="p">,</span><span class="n">nbrs</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">adjacency_iter</span><span class="p">():</span>
<span class="n">nbr_edges</span><span class="o">=</span><span class="p">[</span> <span class="p">(</span><span class="n">u</span><span class="p">,</span><span class="n">data</span><span class="p">)</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">datadict</span> <span class="ow">in</span> <span class="n">nbrs</span><span class="o">.</span><span class="n">items</span><span class="p">()</span>
<span class="k">if</span> <span class="n">u</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">seen</span>
<span class="k">for</span> <span class="n">key</span><span class="p">,</span><span class="n">data</span> <span class="ow">in</span> <span class="n">datadict</span><span class="o">.</span><span class="n">items</span><span class="p">()]</span>
<span class="n">deg</span><span class="o">=</span><span class="nb">len</span><span class="p">(</span><span class="n">nbr_edges</span><span class="p">)</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">s</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="s">"</span><span class="si">%i</span><span class="s">"</span><span class="o">%</span><span class="p">(</span><span class="n">deg</span><span class="p">)</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">d</span> <span class="ow">in</span> <span class="n">nbr_edges</span><span class="p">:</span>
<span class="k">if</span> <span class="n">d</span> <span class="ow">is</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="n">make_str</span><span class="p">(</span><span class="n">d</span><span class="p">)</span>
<span class="n">seen</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">s</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span> <span class="c"># undirected single edges</span>
<span class="n">seen</span><span class="o">=</span><span class="nb">set</span><span class="p">()</span> <span class="c"># helper dict used to avoid duplicate edges</span>
<span class="k">for</span> <span class="n">s</span><span class="p">,</span><span class="n">nbrs</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">adjacency_iter</span><span class="p">():</span>
<span class="n">nbr_edges</span><span class="o">=</span><span class="p">[</span> <span class="p">(</span><span class="n">u</span><span class="p">,</span><span class="n">d</span><span class="p">)</span> <span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">d</span> <span class="ow">in</span> <span class="n">nbrs</span><span class="o">.</span><span class="n">items</span><span class="p">()</span> <span class="k">if</span> <span class="n">u</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">seen</span><span class="p">]</span>
<span class="n">deg</span><span class="o">=</span><span class="nb">len</span><span class="p">(</span><span class="n">nbr_edges</span><span class="p">)</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">s</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="s">"</span><span class="si">%i</span><span class="s">"</span><span class="o">%</span><span class="p">(</span><span class="n">deg</span><span class="p">)</span>
<span class="k">for</span> <span class="n">u</span><span class="p">,</span><span class="n">d</span> <span class="ow">in</span> <span class="n">nbr_edges</span><span class="p">:</span>
<span class="k">if</span> <span class="n">d</span> <span class="ow">is</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">make_str</span><span class="p">(</span><span class="n">u</span><span class="p">)</span><span class="o">+</span><span class="n">delimiter</span><span class="o">+</span><span class="n">make_str</span><span class="p">(</span><span class="n">d</span><span class="p">)</span>
<span class="n">seen</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">s</span><span class="p">)</span>
</div>
<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_multiline_adjlist"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.multiline_adjlist.write_multiline_adjlist.html#networkx.readwrite.multiline_adjlist.write_multiline_adjlist">[docs]</a><span class="k">def</span> <span class="nf">write_multiline_adjlist</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">delimiter</span><span class="o">=</span><span class="s">' '</span><span class="p">,</span>
<span class="n">comments</span><span class="o">=</span><span class="s">'#'</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 the graph G in multiline adjacency list format to path</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> G : NetworkX graph</span>
<span class="sd"> </span>
<span class="sd"> comments : string, optional</span>
<span class="sd"> Marker for comment lines</span>
<span class="sd"> delimiter : string, optional</span>
<span class="sd"> Separator for node labels </span>
<span class="sd"> encoding : string, optional</span>
<span class="sd"> Text encoding. </span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> >>> G=nx.path_graph(4)</span>
<span class="sd"> >>> nx.write_multiline_adjlist(G,"test.adjlist")</span>
<span class="sd"> The path can be a file handle or a string with the name of the file. If a</span>
<span class="sd"> file handle is provided, it has to be opened in 'wb' mode.</span>
<span class="sd"> >>> fh=open("test.adjlist",'wb')</span>
<span class="sd"> >>> nx.write_multiline_adjlist(G,fh)</span>
<span class="sd"> Filenames ending in .gz or .bz2 will be compressed.</span>
<span class="sd"> >>> nx.write_multiline_adjlist(G,"test.adjlist.gz")</span>
<span class="sd"> See Also</span>
<span class="sd"> --------</span>
<span class="sd"> read_multiline_adjlist</span>
<span class="sd"> """</span>
<span class="kn">import</span> <span class="nn">sys</span>
<span class="kn">import</span> <span class="nn">time</span>
<span class="n">pargs</span><span class="o">=</span><span class="n">comments</span><span class="o">+</span><span class="s">" "</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="n">sys</span><span class="o">.</span><span class="n">argv</span><span class="p">)</span>
<span class="n">header</span> <span class="o">=</span> <span class="p">(</span><span class="s">"</span><span class="si">%s</span><span class="se">\n</span><span class="s">"</span> <span class="o">%</span> <span class="p">(</span><span class="n">pargs</span><span class="p">)</span>
<span class="o">+</span> <span class="n">comments</span> <span class="o">+</span> <span class="s">" GMT </span><span class="si">%s</span><span class="se">\n</span><span class="s">"</span> <span class="o">%</span> <span class="p">(</span><span class="n">time</span><span class="o">.</span><span class="n">asctime</span><span class="p">(</span><span class="n">time</span><span class="o">.</span><span class="n">gmtime</span><span class="p">()))</span>
<span class="o">+</span> <span class="n">comments</span> <span class="o">+</span> <span class="s">" </span><span class="si">%s</span><span class="se">\n</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">name</span><span class="p">))</span>
<span class="n">path</span><span class="o">.</span><span class="n">write</span><span class="p">(</span><span class="n">header</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">encoding</span><span class="p">))</span>
<span class="k">for</span> <span class="n">multiline</span> <span class="ow">in</span> <span class="n">generate_multiline_adjlist</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">delimiter</span><span class="p">):</span>
<span class="n">multiline</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">multiline</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">encoding</span><span class="p">))</span>
</div>
<div class="viewcode-block" id="parse_multiline_adjlist"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.multiline_adjlist.parse_multiline_adjlist.html#networkx.readwrite.multiline_adjlist.parse_multiline_adjlist">[docs]</a><span class="k">def</span> <span class="nf">parse_multiline_adjlist</span><span class="p">(</span><span class="n">lines</span><span class="p">,</span> <span class="n">comments</span> <span class="o">=</span> <span class="s">'#'</span><span class="p">,</span> <span class="n">delimiter</span> <span class="o">=</span> <span class="bp">None</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="n">nodetype</span> <span class="o">=</span> <span class="bp">None</span><span class="p">,</span>
<span class="n">edgetype</span> <span class="o">=</span> <span class="bp">None</span><span class="p">):</span>
<span class="sd">"""Parse lines of a multiline adjacency list representation of a graph.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> lines : list or iterator of strings</span>
<span class="sd"> Input data in multiline adjlist format</span>
<span class="sd"> create_using: NetworkX graph container </span>
<span class="sd"> Use given NetworkX graph for holding nodes or edges.</span>
<span class="sd"> nodetype : Python type, optional</span>
<span class="sd"> Convert nodes to this type. </span>
<span class="sd"> </span>
<span class="sd"> comments : string, optional</span>
<span class="sd"> Marker for comment lines</span>
<span class="sd"> delimiter : string, optional</span>
<span class="sd"> Separator for node labels. The default is whitespace. </span>
<span class="sd"> create_using: NetworkX graph container </span>
<span class="sd"> Use given NetworkX graph for holding nodes or edges.</span>
<span class="sd"> Returns</span>
<span class="sd"> -------</span>
<span class="sd"> G: NetworkX graph</span>
<span class="sd"> The graph corresponding to the lines in multiline adjacency list format.</span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> >>> lines = ['1 2',</span>
<span class="sd"> ... "2 {'weight':3, 'name': 'Frodo'}",</span>
<span class="sd"> ... "3 {}",</span>
<span class="sd"> ... "2 1",</span>
<span class="sd"> ... "5 {'weight':6, 'name': 'Saruman'}"]</span>
<span class="sd"> >>> G = nx.parse_multiline_adjlist(iter(lines), nodetype = int)</span>
<span class="sd"> >>> G.nodes()</span>
<span class="sd"> [1, 2, 3, 5]</span>
<span class="sd"> """</span>
<span class="kn">from</span> <span class="nn">ast</span> <span class="kn">import</span> <span class="n">literal_eval</span>
<span class="k">if</span> <span class="n">create_using</span> <span class="ow">is</span> <span class="bp">None</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">Graph</span><span class="p">()</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">G</span><span class="o">=</span><span class="n">create_using</span>
<span class="n">G</span><span class="o">.</span><span class="n">clear</span><span class="p">()</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span><span class="s">"Input graph is not a networkx graph type"</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">p</span><span class="o">=</span><span class="n">line</span><span class="o">.</span><span class="n">find</span><span class="p">(</span><span class="n">comments</span><span class="p">)</span>
<span class="k">if</span> <span class="n">p</span><span class="o">>=</span><span class="mi">0</span><span class="p">:</span>
<span class="n">line</span> <span class="o">=</span> <span class="n">line</span><span class="p">[:</span><span class="n">p</span><span class="p">]</span>
<span class="k">if</span> <span class="ow">not</span> <span class="n">line</span><span class="p">:</span> <span class="k">continue</span>
<span class="k">try</span><span class="p">:</span>
<span class="p">(</span><span class="n">u</span><span class="p">,</span><span class="n">deg</span><span class="p">)</span><span class="o">=</span><span class="n">line</span><span class="o">.</span><span class="n">strip</span><span class="p">()</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="n">delimiter</span><span class="p">)</span>
<span class="n">deg</span><span class="o">=</span><span class="nb">int</span><span class="p">(</span><span class="n">deg</span><span class="p">)</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span><span class="s">"Failed to read node and degree on line (</span><span class="si">%s</span><span class="s">)"</span><span class="o">%</span><span class="n">line</span><span class="p">)</span>
<span class="k">if</span> <span class="n">nodetype</span> <span class="ow">is</span> <span class="ow">not</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">u</span><span class="o">=</span><span class="n">nodetype</span><span class="p">(</span><span class="n">u</span><span class="p">)</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span><span class="s">"Failed to convert node (</span><span class="si">%s</span><span class="s">) to type </span><span class="si">%s</span><span class="s">"</span>\
<span class="o">%</span><span class="p">(</span><span class="n">u</span><span class="p">,</span><span class="n">nodetype</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">u</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="n">deg</span><span class="p">):</span>
<span class="k">while</span> <span class="bp">True</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">line</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="ne">StopIteration</span><span class="p">:</span>
<span class="n">msg</span> <span class="o">=</span> <span class="s">"Failed to find neighbor for node (</span><span class="si">%s</span><span class="s">)"</span> <span class="o">%</span> <span class="p">(</span><span class="n">u</span><span class="p">,)</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span>
<span class="n">p</span><span class="o">=</span><span class="n">line</span><span class="o">.</span><span class="n">find</span><span class="p">(</span><span class="n">comments</span><span class="p">)</span>
<span class="k">if</span> <span class="n">p</span><span class="o">>=</span><span class="mi">0</span><span class="p">:</span>
<span class="n">line</span> <span class="o">=</span> <span class="n">line</span><span class="p">[:</span><span class="n">p</span><span class="p">]</span>
<span class="k">if</span> <span class="n">line</span><span class="p">:</span> <span class="k">break</span>
<span class="n">vlist</span><span class="o">=</span><span class="n">line</span><span class="o">.</span><span class="n">strip</span><span class="p">()</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="n">delimiter</span><span class="p">)</span>
<span class="n">numb</span><span class="o">=</span><span class="nb">len</span><span class="p">(</span><span class="n">vlist</span><span class="p">)</span>
<span class="k">if</span> <span class="n">numb</span><span class="o"><</span><span class="mi">1</span><span class="p">:</span>
<span class="k">continue</span> <span class="c"># isolated node</span>
<span class="n">v</span><span class="o">=</span><span class="n">vlist</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
<span class="n">data</span><span class="o">=</span><span class="s">''</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="n">vlist</span><span class="p">)</span>
<span class="k">if</span> <span class="n">nodetype</span> <span class="ow">is</span> <span class="ow">not</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">v</span><span class="o">=</span><span class="n">nodetype</span><span class="p">(</span><span class="n">v</span><span class="p">)</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span>
<span class="s">"Failed to convert node (</span><span class="si">%s</span><span class="s">) to type </span><span class="si">%s</span><span class="s">"</span>\
<span class="o">%</span><span class="p">(</span><span class="n">v</span><span class="p">,</span><span class="n">nodetype</span><span class="p">))</span>
<span class="k">if</span> <span class="n">edgetype</span> <span class="ow">is</span> <span class="ow">not</span> <span class="bp">None</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">edgedata</span><span class="o">=</span><span class="p">{</span><span class="s">'weight'</span><span class="p">:</span><span class="n">edgetype</span><span class="p">(</span><span class="n">data</span><span class="p">)}</span>
<span class="k">except</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span>
<span class="s">"Failed to convert edge data (</span><span class="si">%s</span><span class="s">) to type </span><span class="si">%s</span><span class="s">"</span>\
<span class="o">%</span><span class="p">(</span><span class="n">data</span><span class="p">,</span> <span class="n">edgetype</span><span class="p">))</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span> <span class="c"># try to evaluate </span>
<span class="n">edgedata</span><span class="o">=</span><span class="n">literal_eval</span><span class="p">(</span><span class="n">data</span><span class="p">)</span>
<span class="k">except</span><span class="p">:</span>
<span class="n">edgedata</span><span class="o">=</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">u</span><span class="p">,</span><span class="n">v</span><span class="p">,</span><span class="n">attr_dict</span><span class="o">=</span><span class="n">edgedata</span><span class="p">)</span>
<span class="k">return</span> <span class="n">G</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_multiline_adjlist"><a class="viewcode-back" href="../../../reference/generated/networkx.readwrite.multiline_adjlist.read_multiline_adjlist.html#networkx.readwrite.multiline_adjlist.read_multiline_adjlist">[docs]</a><span class="k">def</span> <span class="nf">read_multiline_adjlist</span><span class="p">(</span><span class="n">path</span><span class="p">,</span> <span class="n">comments</span><span class="o">=</span><span class="s">"#"</span><span class="p">,</span> <span class="n">delimiter</span><span class="o">=</span><span class="bp">None</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="n">nodetype</span><span class="o">=</span><span class="bp">None</span><span class="p">,</span> <span class="n">edgetype</span><span class="o">=</span><span class="bp">None</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 multi-line adjacency list format from path.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> path : string or file</span>
<span class="sd"> Filename or file handle to read.</span>
<span class="sd"> Filenames ending in .gz or .bz2 will be uncompressed.</span>
<span class="sd"> create_using: NetworkX graph container </span>
<span class="sd"> Use given NetworkX graph for holding nodes or edges.</span>
<span class="sd"> nodetype : Python type, optional</span>
<span class="sd"> Convert nodes to this type. </span>
<span class="sd"> </span>
<span class="sd"> edgetype : Python type, optional</span>
<span class="sd"> Convert edge data to this type.</span>
<span class="sd"> comments : string, optional</span>
<span class="sd"> Marker for comment lines</span>
<span class="sd"> delimiter : string, optional</span>
<span class="sd"> Separator for node labels. The default is whitespace. </span>
<span class="sd"> create_using: NetworkX graph container </span>
<span class="sd"> Use given NetworkX graph for holding nodes or edges.</span>
<span class="sd"> Returns</span>
<span class="sd"> -------</span>
<span class="sd"> G: NetworkX graph</span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> >>> G=nx.path_graph(4)</span>
<span class="sd"> >>> nx.write_multiline_adjlist(G,"test.adjlist")</span>
<span class="sd"> >>> G=nx.read_multiline_adjlist("test.adjlist")</span>
<span class="sd"> The path can be a file or a string with the name of the file. If a</span>
<span class="sd"> file s provided, it has to be opened in 'rb' mode.</span>
<span class="sd"> >>> fh=open("test.adjlist", 'rb')</span>
<span class="sd"> >>> G=nx.read_multiline_adjlist(fh)</span>
<span class="sd"> Filenames ending in .gz or .bz2 will be compressed.</span>
<span class="sd"> >>> nx.write_multiline_adjlist(G,"test.adjlist.gz")</span>
<span class="sd"> >>> G=nx.read_multiline_adjlist("test.adjlist.gz")</span>
<span class="sd"> The optional nodetype is a function to convert node strings to nodetype.</span>
<span class="sd"> For example</span>
<span class="sd"> >>> G=nx.read_multiline_adjlist("test.adjlist", nodetype=int)</span>
<span class="sd"> will attempt to convert all nodes to integer type.</span>
<span class="sd"> The optional edgetype is a function to convert edge data strings to </span>
<span class="sd"> edgetype. </span>
<span class="sd"> >>> G=nx.read_multiline_adjlist("test.adjlist")</span>
<span class="sd"> The optional create_using parameter is a NetworkX graph container.</span>
<span class="sd"> The default is Graph(), an undirected graph. To read the data as </span>
<span class="sd"> a directed graph use</span>
<span class="sd"> >>> G=nx.read_multiline_adjlist("test.adjlist", create_using=nx.DiGraph())</span>
<span class="sd"> </span>
<span class="sd"> Notes</span>
<span class="sd"> -----</span>
<span class="sd"> This format does not store graph, node, or edge data.</span>
<span class="sd"> See Also</span>
<span class="sd"> --------</span>
<span class="sd"> write_multiline_adjlist</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_multiline_adjlist</span><span class="p">(</span><span class="n">lines</span><span class="p">,</span>
<span class="n">comments</span> <span class="o">=</span> <span class="n">comments</span><span class="p">,</span>
<span class="n">delimiter</span> <span class="o">=</span> <span class="n">delimiter</span><span class="p">,</span>
<span class="n">create_using</span> <span class="o">=</span> <span class="n">create_using</span><span class="p">,</span>
<span class="n">nodetype</span> <span class="o">=</span> <span class="n">nodetype</span><span class="p">,</span>
<span class="n">edgetype</span> <span class="o">=</span> <span class="n">edgetype</span><span class="p">)</span>
<span class="c"># fixture for nose tests</span></div>
<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.adjlist'</span><span class="p">)</span>
<span class="n">os</span><span class="o">.</span><span class="n">unlink</span><span class="p">(</span><span class="s">'test.adjlist.gz'</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>
