OpenI
/
graphkit-learn



<!DOCTYPE html>
<!--[if IE 8]><html class="no-js lt-ie9" lang="en" > <![endif]-->
<!--[if gt IE 8]><!--> <html class="no-js" lang="en" > <!--<![endif]-->
<head>
  <meta charset="utf-8">
  
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  
  <title>pygraph.utils.graphdataset &mdash; py-graph  documentation</title>
  

  <script type="text/javascript" src="../../../_static/js/modernizr.min.js"></script>
  
    
      <script type="text/javascript" id="documentation_options" data-url_root="../../../" src="../../../_static/documentation_options.js"></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>
        <script async="async" type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
    
    <script type="text/javascript" src="../../../_static/js/theme.js"></script>

    
  <link rel="stylesheet" href="../../../_static/css/theme.css" type="text/css" />
  <link rel="stylesheet" href="../../../_static/pygments.css" type="text/css" />
    <link rel="index" title="Index" href="../../../genindex.html" />
    <link rel="search" title="Search" href="../../../search.html" /> 
</head>

<body class="wy-body-for-nav">

   
  <div class="wy-grid-for-nav">
    
    <nav data-toggle="wy-nav-shift" class="wy-nav-side">
      <div class="wy-side-scroll">
        <div class="wy-side-nav-search" >
          

            <a href="../../../index.html" class="icon icon-home"> py-graph
          

          </a>

          
              <div class="version">
                1.0
              </div>
            
          
<div role="search">
  <form id="rtd-search-form" class="wy-form" action="../../../search.html" method="get">
    <input type="text" name="q" placeholder="Search docs" />
    <input type="hidden" name="check_keywords" value="yes" />
    <input type="hidden" name="area" value="default" />
  </form>
</div>

          
        </div>

        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="main navigation">
          
            
              <!-- Local TOC -->
              <div class="local-toc"></div>
            
          
        </div>
      </div>
    </nav>

    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">

      
      <nav class="wy-nav-top" aria-label="top navigation">
        
          <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
          <a href="../../../index.html">py-graph</a>
        
      </nav>


      <div class="wy-nav-content">
        
        <div class="rst-content">
        
          
<div role="navigation" aria-label="breadcrumbs navigation">

  <ul class="wy-breadcrumbs">
    
      <li><a href="../../../index.html">Docs</a> &raquo;</li>
        
          <li><a href="../../index.html">Module code</a> &raquo;</li>
        
      <li>pygraph.utils.graphdataset</li>
    
    
      <li class="wy-breadcrumbs-aside">
        
      </li>
    
  </ul>

  
  <hr/>
</div>
          <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
           <div itemprop="articleBody">
            
  <h1>Source code for pygraph.utils.graphdataset</h1><div class="highlight"><pre>
<span></span><span class="sd">&quot;&quot;&quot; Obtain all kinds of attributes of a graph dataset.</span>
<span class="sd">&quot;&quot;&quot;</span>


<div class="viewcode-block" id="get_dataset_attributes"><a class="viewcode-back" href="../../../pygraph.utils.html#pygraph.utils.graphdataset.get_dataset_attributes">[docs]</a><span class="k">def</span> <span class="nf">get_dataset_attributes</span><span class="p">(</span><span class="n">Gn</span><span class="p">,</span>
                           <span class="n">target</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span>
                           <span class="n">attr_names</span><span class="o">=</span><span class="p">[],</span>
                           <span class="n">node_label</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span>
                           <span class="n">edge_label</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
    <span class="sd">&quot;&quot;&quot;Returns the structure and property information of the graph dataset Gn.</span>

<span class="sd">    Parameters</span>
<span class="sd">    ----------</span>
<span class="sd">    Gn : List of NetworkX graph</span>
<span class="sd">        List of graphs whose information will be returned.</span>
<span class="sd">    target : list</span>
<span class="sd">        The list of classification targets corresponding to Gn. Only works for </span>
<span class="sd">        classification problems.</span>
<span class="sd">    attr_names : list</span>
<span class="sd">        List of strings which indicate which informations will be returned. The</span>
<span class="sd">        possible choices includes:</span>
<span class="sd">        &#39;substructures&#39;: sub-structures Gn contains, including &#39;linear&#39;, &#39;non </span>
<span class="sd">            linear&#39; and &#39;cyclic&#39;.</span>
<span class="sd">        &#39;node_labeled&#39;: whether vertices have symbolic labels.</span>
<span class="sd">        &#39;edge_labeled&#39;: whether egdes have symbolic labels.</span>
<span class="sd">        &#39;is_directed&#39;: whether graphs in Gn are directed.</span>
<span class="sd">        &#39;dataset_size&#39;: number of graphs in Gn.</span>
<span class="sd">        &#39;ave_node_num&#39;: average number of vertices of graphs in Gn.</span>
<span class="sd">        &#39;min_node_num&#39;: minimum number of vertices of graphs in Gn.</span>
<span class="sd">        &#39;max_node_num&#39;: maximum number of vertices of graphs in Gn.</span>
<span class="sd">        &#39;ave_edge_num&#39;: average number of edges of graphs in Gn.</span>
<span class="sd">        &#39;min_edge_num&#39;: minimum number of edges of graphs in Gn.</span>
<span class="sd">        &#39;max_edge_num&#39;: maximum number of edges of graphs in Gn.</span>
<span class="sd">        &#39;ave_node_degree&#39;: average vertex degree of graphs in Gn.</span>
<span class="sd">        &#39;min_node_degree&#39;: minimum vertex degree of graphs in Gn.</span>
<span class="sd">        &#39;max_node_degree&#39;: maximum vertex degree of graphs in Gn.</span>
<span class="sd">        &#39;ave_fill_factor&#39;: average fill factor (number_of_edges / </span>
<span class="sd">            (number_of_nodes ** 2)) of graphs in Gn.</span>
<span class="sd">        &#39;min_fill_factor&#39;: minimum fill factor of graphs in Gn.</span>
<span class="sd">        &#39;max_fill_factor&#39;: maximum fill factor of graphs in Gn.</span>
<span class="sd">        &#39;node_label_num&#39;: number of symbolic vertex labels.</span>
<span class="sd">        &#39;edge_label_num&#39;: number of symbolic edge labels.</span>
<span class="sd">        &#39;node_attr_dim&#39;: number of dimensions of non-symbolic vertex labels. </span>
<span class="sd">            Extracted from the &#39;attributes&#39; attribute of graph nodes.</span>
<span class="sd">        &#39;edge_attr_dim&#39;: number of dimensions of non-symbolic edge labels.</span>
<span class="sd">            Extracted from the &#39;attributes&#39; attribute of graph edges.</span>
<span class="sd">        &#39;class_number&#39;: number of classes. Only available for classification </span>
<span class="sd">            problems.</span>
<span class="sd">    node_label : string</span>
<span class="sd">        Node attribute used as label. The default node label is atom. Mandatory</span>
<span class="sd">        when &#39;node_labeled&#39; or &#39;node_label_num&#39; is required.</span>
<span class="sd">    edge_label : string</span>
<span class="sd">        Edge attribute used as label. The default edge label is bond_type. </span>
<span class="sd">        Mandatory when &#39;edge_labeled&#39; or &#39;edge_label_num&#39; is required.</span>

<span class="sd">    Return</span>
<span class="sd">    ------</span>
<span class="sd">    attrs : dict</span>
<span class="sd">        Value for each property.</span>
<span class="sd">    &quot;&quot;&quot;</span>
    <span class="kn">import</span> <span class="nn">networkx</span> <span class="k">as</span> <span class="nn">nx</span>
    <span class="kn">import</span> <span class="nn">numpy</span> <span class="k">as</span> <span class="nn">np</span>

    <span class="n">attrs</span> <span class="o">=</span> <span class="p">{}</span>

    <span class="k">def</span> <span class="nf">get_dataset_size</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">get_all_node_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="p">[</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">]</span>

    <span class="k">def</span> <span class="nf">get_ave_node_num</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">get_min_node_num</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amin</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">get_max_node_num</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amax</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">get_all_edge_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="p">[</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">]</span>

    <span class="k">def</span> <span class="nf">get_ave_edge_num</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">get_min_edge_num</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amin</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">get_max_edge_num</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amax</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">is_node_labeled</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="kc">False</span> <span class="k">if</span> <span class="n">node_label</span> <span class="ow">is</span> <span class="kc">None</span> <span class="k">else</span> <span class="kc">True</span>

    <span class="k">def</span> <span class="nf">get_node_label_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="n">nl</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
        <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">:</span>
            <span class="n">nl</span> <span class="o">=</span> <span class="n">nl</span> <span class="o">|</span> <span class="nb">set</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">get_node_attributes</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">node_label</span><span class="p">)</span><span class="o">.</span><span class="n">values</span><span class="p">())</span>
        <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">nl</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">is_edge_labeled</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="kc">False</span> <span class="k">if</span> <span class="n">edge_label</span> <span class="ow">is</span> <span class="kc">None</span> <span class="k">else</span> <span class="kc">True</span>

    <span class="k">def</span> <span class="nf">get_edge_label_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="n">el</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
        <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">:</span>
            <span class="n">el</span> <span class="o">=</span> <span class="n">el</span> <span class="o">|</span> <span class="nb">set</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">get_edge_attributes</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">edge_label</span><span class="p">)</span><span class="o">.</span><span class="n">values</span><span class="p">())</span>
        <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">el</span><span class="p">)</span>

    <span class="k">def</span> <span class="nf">is_directed</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">nx</span><span class="o">.</span><span class="n">is_directed</span><span class="p">(</span><span class="n">Gn</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>

    <span class="k">def</span> <span class="nf">get_ave_node_degree</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">([</span><span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="nb">dict</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="o">.</span><span class="n">values</span><span class="p">()))</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">])</span>

    <span class="k">def</span> <span class="nf">get_max_node_degree</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amax</span><span class="p">([</span><span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="nb">dict</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="o">.</span><span class="n">values</span><span class="p">()))</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">])</span>

    <span class="k">def</span> <span class="nf">get_min_node_degree</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amin</span><span class="p">([</span><span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="nb">dict</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="o">.</span><span class="n">values</span><span class="p">()))</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">])</span>
    
    <span class="c1"># get fill factor, the number of non-zero entries in the adjacency matrix.</span>
    <span class="k">def</span> <span class="nf">get_ave_fill_factor</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">mean</span><span class="p">([</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">/</span> <span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> 
                                           <span class="o">*</span> <span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">])</span>

    <span class="k">def</span> <span class="nf">get_max_fill_factor</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amax</span><span class="p">([</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">/</span> <span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> 
                                           <span class="o">*</span> <span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">])</span>

    <span class="k">def</span> <span class="nf">get_min_fill_factor</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">return</span> <span class="n">np</span><span class="o">.</span><span class="n">amin</span><span class="p">([</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">/</span> <span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> 
                                           <span class="o">*</span> <span class="n">nx</span><span class="o">.</span><span class="n">number_of_nodes</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">])</span>

    <span class="k">def</span> <span class="nf">get_substructures</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="n">subs</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
        <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">:</span>
            <span class="n">degrees</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">dict</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="o">.</span><span class="n">values</span><span class="p">())</span>
            <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="mi">2</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">degrees</span><span class="p">):</span>
                <span class="n">subs</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="s1">&#39;linear&#39;</span><span class="p">)</span>
            <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">amax</span><span class="p">(</span><span class="n">degrees</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">3</span><span class="p">:</span>
                <span class="n">subs</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="s1">&#39;non linear&#39;</span><span class="p">)</span>
            <span class="k">if</span> <span class="s1">&#39;linear&#39;</span> <span class="ow">in</span> <span class="n">subs</span> <span class="ow">and</span> <span class="s1">&#39;non linear&#39;</span> <span class="ow">in</span> <span class="n">subs</span><span class="p">:</span>
                <span class="k">break</span>

        <span class="k">if</span> <span class="n">is_directed</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
            <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">:</span>
                <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">find_cycle</span><span class="p">(</span><span class="n">G</span><span class="p">)))</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">:</span>
                    <span class="n">subs</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="s1">&#39;cyclic&#39;</span><span class="p">)</span>
                    <span class="k">break</span>
        <span class="c1"># else:</span>
        <span class="c1">#     # @todo: this method does not work for big graph with large amount of edges like D&amp;D, try a better way.</span>
        <span class="c1">#     upper = np.amin([nx.number_of_edges(G) for G in Gn]) * 2 + 10</span>
        <span class="c1">#     for G in Gn:</span>
        <span class="c1">#         if (nx.number_of_edges(G) &lt; upper):</span>
        <span class="c1">#             cyc = list(nx.simple_cycles(G.to_directed()))</span>
        <span class="c1">#             if any(len(i) &gt; 2 for i in cyc):</span>
        <span class="c1">#                 subs.add(&#39;cyclic&#39;)</span>
        <span class="c1">#                 break</span>
        <span class="c1">#     if &#39;cyclic&#39; not in subs:</span>
        <span class="c1">#         for G in Gn:</span>
        <span class="c1">#             cyc = list(nx.simple_cycles(G.to_directed()))</span>
        <span class="c1">#             if any(len(i) &gt; 2 for i in cyc):</span>
        <span class="c1">#                 subs.add(&#39;cyclic&#39;)</span>
        <span class="c1">#                 break</span>

        <span class="k">return</span> <span class="n">subs</span>

    <span class="k">def</span> <span class="nf">get_class_num</span><span class="p">(</span><span class="n">target</span><span class="p">):</span>
        <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="nb">set</span><span class="p">(</span><span class="n">target</span><span class="p">))</span>

    <span class="k">def</span> <span class="nf">get_node_attr_dim</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">:</span>
            <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">(</span><span class="n">data</span><span class="o">=</span><span class="kc">True</span><span class="p">):</span>
                <span class="k">if</span> <span class="s1">&#39;attributes&#39;</span> <span class="ow">in</span> <span class="n">n</span><span class="p">[</span><span class="mi">1</span><span class="p">]:</span>
                    <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">n</span><span class="p">[</span><span class="mi">1</span><span class="p">][</span><span class="s1">&#39;attributes&#39;</span><span class="p">])</span>
        <span class="k">return</span> <span class="mi">0</span>

    <span class="k">def</span> <span class="nf">get_edge_attr_dim</span><span class="p">(</span><span class="n">Gn</span><span class="p">):</span>
        <span class="k">for</span> <span class="n">G</span> <span class="ow">in</span> <span class="n">Gn</span><span class="p">:</span>
            <span class="k">if</span> <span class="n">nx</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">:</span>
                <span class="k">for</span> <span class="n">e</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="kc">True</span><span class="p">):</span>
                    <span class="k">if</span> <span class="s1">&#39;attributes&#39;</span> <span class="ow">in</span> <span class="n">e</span><span class="p">[</span><span class="mi">2</span><span class="p">]:</span>
                        <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">e</span><span class="p">[</span><span class="mi">2</span><span class="p">][</span><span class="s1">&#39;attributes&#39;</span><span class="p">])</span>
        <span class="k">return</span> <span class="mi">0</span>

    <span class="k">if</span> <span class="n">attr_names</span> <span class="o">==</span> <span class="p">[]:</span>
        <span class="n">attr_names</span> <span class="o">=</span> <span class="p">[</span>
            <span class="s1">&#39;substructures&#39;</span><span class="p">,</span>
            <span class="s1">&#39;node_labeled&#39;</span><span class="p">,</span>
            <span class="s1">&#39;edge_labeled&#39;</span><span class="p">,</span>
            <span class="s1">&#39;is_directed&#39;</span><span class="p">,</span>
            <span class="s1">&#39;dataset_size&#39;</span><span class="p">,</span>
            <span class="s1">&#39;ave_node_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;min_node_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;max_node_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;ave_edge_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;min_edge_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;max_edge_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;ave_node_degree&#39;</span><span class="p">,</span>
            <span class="s1">&#39;min_node_degree&#39;</span><span class="p">,</span>
            <span class="s1">&#39;max_node_degree&#39;</span><span class="p">,</span>
            <span class="s1">&#39;ave_fill_factor&#39;</span><span class="p">,</span>
            <span class="s1">&#39;min_fill_factor&#39;</span><span class="p">,</span>
            <span class="s1">&#39;max_fill_factor&#39;</span><span class="p">,</span>
            <span class="s1">&#39;node_label_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;edge_label_num&#39;</span><span class="p">,</span>
            <span class="s1">&#39;node_attr_dim&#39;</span><span class="p">,</span>
            <span class="s1">&#39;edge_attr_dim&#39;</span><span class="p">,</span>
            <span class="s1">&#39;class_number&#39;</span><span class="p">,</span>
        <span class="p">]</span>

    <span class="c1"># dataset size</span>
    <span class="k">if</span> <span class="s1">&#39;dataset_size&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;dataset_size&#39;</span><span class="p">:</span> <span class="n">get_dataset_size</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="c1"># graph node number</span>
    <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">i</span> <span class="ow">in</span> <span class="n">attr_names</span>
           <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="p">[</span><span class="s1">&#39;ave_node_num&#39;</span><span class="p">,</span> <span class="s1">&#39;min_node_num&#39;</span><span class="p">,</span> <span class="s1">&#39;max_node_num&#39;</span><span class="p">]):</span>

        <span class="n">all_node_num</span> <span class="o">=</span> <span class="n">get_all_node_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="k">if</span> <span class="s1">&#39;ave_node_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;ave_node_num&#39;</span><span class="p">:</span> <span class="n">get_ave_node_num</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;min_node_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;min_node_num&#39;</span><span class="p">:</span> <span class="n">get_min_node_num</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;max_node_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;max_node_num&#39;</span><span class="p">:</span> <span class="n">get_max_node_num</span><span class="p">(</span><span class="n">all_node_num</span><span class="p">)})</span>

    <span class="c1"># graph edge number</span>
    <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">i</span> <span class="ow">in</span> <span class="n">attr_names</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span>
           <span class="p">[</span><span class="s1">&#39;ave_edge_num&#39;</span><span class="p">,</span> <span class="s1">&#39;min_edge_num&#39;</span><span class="p">,</span> <span class="s1">&#39;max_edge_num&#39;</span><span class="p">]):</span>

        <span class="n">all_edge_num</span> <span class="o">=</span> <span class="n">get_all_edge_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="k">if</span> <span class="s1">&#39;ave_edge_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;ave_edge_num&#39;</span><span class="p">:</span> <span class="n">get_ave_edge_num</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;max_edge_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;max_edge_num&#39;</span><span class="p">:</span> <span class="n">get_max_edge_num</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;min_edge_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>

        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;min_edge_num&#39;</span><span class="p">:</span> <span class="n">get_min_edge_num</span><span class="p">(</span><span class="n">all_edge_num</span><span class="p">)})</span>

    <span class="c1"># label number</span>
    <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">i</span> <span class="ow">in</span> <span class="n">attr_names</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="p">[</span><span class="s1">&#39;node_labeled&#39;</span><span class="p">,</span> <span class="s1">&#39;node_label_num&#39;</span><span class="p">]):</span>
        <span class="n">is_nl</span> <span class="o">=</span> <span class="n">is_node_labeled</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>
        <span class="n">node_label_num</span> <span class="o">=</span> <span class="n">get_node_label_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="k">if</span> <span class="s1">&#39;node_labeled&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="c1"># graphs are considered node unlabeled if all nodes have the same label.</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;node_labeled&#39;</span><span class="p">:</span> <span class="n">is_nl</span> <span class="k">if</span> <span class="n">node_label_num</span> <span class="o">&gt;</span> <span class="mi">1</span> <span class="k">else</span> <span class="kc">False</span><span class="p">})</span>

    <span class="k">if</span> <span class="s1">&#39;node_label_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;node_label_num&#39;</span><span class="p">:</span> <span class="n">node_label_num</span><span class="p">})</span>

    <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">i</span> <span class="ow">in</span> <span class="n">attr_names</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="p">[</span><span class="s1">&#39;edge_labeled&#39;</span><span class="p">,</span> <span class="s1">&#39;edge_label_num&#39;</span><span class="p">]):</span>
        <span class="n">is_el</span> <span class="o">=</span> <span class="n">is_edge_labeled</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>
        <span class="n">edge_label_num</span> <span class="o">=</span> <span class="n">get_edge_label_num</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="k">if</span> <span class="s1">&#39;edge_labeled&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="c1"># graphs are considered edge unlabeled if all edges have the same label.</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;edge_labeled&#39;</span><span class="p">:</span> <span class="n">is_el</span> <span class="k">if</span> <span class="n">edge_label_num</span> <span class="o">&gt;</span> <span class="mi">1</span> <span class="k">else</span> <span class="kc">False</span><span class="p">})</span>

    <span class="k">if</span> <span class="s1">&#39;edge_label_num&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;edge_label_num&#39;</span><span class="p">:</span> <span class="n">edge_label_num</span><span class="p">})</span>

    <span class="k">if</span> <span class="s1">&#39;is_directed&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;is_directed&#39;</span><span class="p">:</span> <span class="n">is_directed</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;ave_node_degree&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;ave_node_degree&#39;</span><span class="p">:</span> <span class="n">get_ave_node_degree</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;max_node_degree&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;max_node_degree&#39;</span><span class="p">:</span> <span class="n">get_max_node_degree</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;min_node_degree&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;min_node_degree&#39;</span><span class="p">:</span> <span class="n">get_min_node_degree</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>
        
    <span class="k">if</span> <span class="s1">&#39;ave_fill_factor&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;ave_fill_factor&#39;</span><span class="p">:</span> <span class="n">get_ave_fill_factor</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;max_fill_factor&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;max_fill_factor&#39;</span><span class="p">:</span> <span class="n">get_max_fill_factor</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;min_fill_factor&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;min_fill_factor&#39;</span><span class="p">:</span> <span class="n">get_min_fill_factor</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;substructures&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;substructures&#39;</span><span class="p">:</span> <span class="n">get_substructures</span><span class="p">(</span><span class="n">Gn</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;class_number&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="o">.</span><span class="n">update</span><span class="p">({</span><span class="s1">&#39;class_number&#39;</span><span class="p">:</span> <span class="n">get_class_num</span><span class="p">(</span><span class="n">target</span><span class="p">)})</span>

    <span class="k">if</span> <span class="s1">&#39;node_attr_dim&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="p">[</span><span class="s1">&#39;node_attr_dim&#39;</span><span class="p">]</span> <span class="o">=</span> <span class="n">get_node_attr_dim</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="k">if</span> <span class="s1">&#39;edge_attr_dim&#39;</span> <span class="ow">in</span> <span class="n">attr_names</span><span class="p">:</span>
        <span class="n">attrs</span><span class="p">[</span><span class="s1">&#39;edge_attr_dim&#39;</span><span class="p">]</span> <span class="o">=</span> <span class="n">get_edge_attr_dim</span><span class="p">(</span><span class="n">Gn</span><span class="p">)</span>

    <span class="kn">from</span> <span class="nn">collections</span> <span class="k">import</span> <span class="n">OrderedDict</span>
    <span class="k">return</span> <span class="n">OrderedDict</span><span class="p">(</span>
        <span class="nb">sorted</span><span class="p">(</span><span class="n">attrs</span><span class="o">.</span><span class="n">items</span><span class="p">(),</span> <span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">i</span><span class="p">:</span> <span class="n">attr_names</span><span class="o">.</span><span class="n">index</span><span class="p">(</span><span class="n">i</span><span class="p">[</span><span class="mi">0</span><span class="p">])))</span></div>
</pre></div>

           </div>
           
          </div>
          <footer>
  

  <hr/>

  <div role="contentinfo">
    <p>
        &copy; Copyright 2020, Linlin Jia

    </p>
  </div>
  Built with <a href="http://sphinx-doc.org/">Sphinx</a> using a <a href="https://github.com/rtfd/sphinx_rtd_theme">theme</a> provided by <a href="https://readthedocs.org">Read the Docs</a>. 

</footer>

        </div>
      </div>

    </section>

  </div>
  

  <script type="text/javascript">
      jQuery(function () {
          SphinxRtdTheme.Navigation.enable(true);
      });
  </script>

  
</body>
</html>