03_example_graphs.ipynb: Whitespace cleanup

Accidental result of running `nbdev_update_lib`, but nevertheless good
change.

Author: jnareb

03_example_graphs.ipynb

@@ -97,7 +97,7 @@
     "#export\n",
     "def crown_DAG():\n",
     "    \"\"\"Returns crown DAG known as S_3^0 graph\n",
-    "    \n",
+    "\n",
     "    Returns\n",
     "    -------\n",
     "    graph : networkx.DiGraph\n",
@@ -106,7 +106,7 @@
     "    DG=nx.DiGraph()\n",
     "    DG.add_nodes_from([1,2,3,4,'u','v'])\n",
     "    DG.add_edges_from([(1,2),(3,4),(1,'v'),(3,'v'),('u',2),('u',4)])\n",
-    "    return DG\n"
+    "    return DG"
    ]
   },
   {
@@ -301,7 +301,7 @@
     "#export\n",
     "def small_DAG_FELINE():\n",
     "    \"\"\"Create small DAG (example in Figure 2 in FELINE paper)\n",
-    "        \n",
+    "\n",
     "    Returns\n",
     "    -------\n",
     "    graph : networkx.DiGraph\n",
@@ -310,7 +310,7 @@
     "    sd=nx.DiGraph()\n",
     "    sd.add_nodes_from([chr(c) for c in range(ord('a'),ord('h')+1)])\n",
     "    sd.add_edges_from([('a','c'),('a','d'),('a','e'),('b','f'),('b','g'),('c','h'),('e','h'),('f','h')])\n",
-    "    return sd\n"
+    "    return sd"
    ]
   },
   {
@@ -502,22 +502,22 @@
     "#export\n",
     "def tree_DAG():\n",
     "    \"\"\"Create tree DAG ('didactic example' in Figure 6 in FELINE paper)\n",
-    "    \n",
+    "\n",
     "    The created tree graph has a single source node with out-degree of 3,\n",
     "    its 3 out-neighbours have out-degrees, respectively, of 2, 1 and 2.\n",
     "    Out-neighbours of those nodes are sink nodes with out-degree of 0.\n",
     "    The tree has maximum level of 3.\n",
-    "    \n",
+    "\n",
     "    Below there is ASCII-art rendering of this graph; edges point downward\n",
-    "    \n",
-    "                                'a' \n",
+    "\n",
+    "                                'a'\n",
     "                              __/|\\__\n",
     "                             /   |   \\\n",
     "                           'b'  'c'  'd'\n",
     "                           / \\   |   / \\\n",
     "                          /  |   |   |  \\\n",
     "                        'e' 'f' 'g' 'h' 'i'\n",
-    "    \n",
+    "\n",
     "    Returns\n",
     "    -------\n",
     "    graph : networkx.DiGraph\n",
@@ -729,7 +729,7 @@
     "#export\n",
     "def levels_DAG_FELINE():\n",
     "    \"\"\"Create graph from Figure 9 in FELINE paper, used to show levels-filter\n",
-    "    \n",
+    "\n",
     "    Returns\n",
     "    -------\n",
     "    graph : networkx.DiGraph\n",
@@ -742,7 +742,7 @@
     "                       ('d','g'),\n",
     "                       ('e','h'),\n",
     "                       ('f','g'),('f','i')])\n",
-    "    return lf\n"
+    "    return lf"
    ]
   },
   {
@@ -1036,14 +1036,14 @@
     "#export\n",
     "def RCH_graph():\n",
     "    \"\"\"Create RCH example graph (example in Figure 1 and 2 in PReaCH paper)\n",
-    "    \n",
+    "\n",
     "    Positions of nodes in the drawing from Figure 1 and 2 in PReaCH paper\n",
     "    is stored in `pos` attribute of returned graph object.\n",
-    "    \n",
+    "\n",
     "    Backward topological levels (i.e. with level equal to 0 for nodes\n",
     "    with no outgoing edges, that is with out-degree of 0) are stored\n",
     "    in `lvl` attribute of returned graph object.\n",
-    "    \n",
+    "\n",
     "    Returns\n",
     "    -------\n",
     "    graph : networkx.DiGraph\n",
@@ -1066,7 +1066,7 @@
     "                       ('l','q'),\n",
     "                       ('m','q'),\n",
     "                      ])\n",
-    "    \n",
+    "\n",
     "    # backward topological levels (max path length to sink node)\n",
     "    ch.lvl={\n",
     "        'o':0,'p':0,'q':0,'n':0,\n",
@@ -1079,9 +1079,9 @@
     "        'a':(0,0),'b':(1,0),          'c':(3,0),'d':(4,0),\n",
     "        'e':(0,1),'f':(1,1),'g':(2,1),'h':(3,1),'i':(4,1),\n",
     "        'j':(0,2),'k':(1,2),'l':(2,2),'m':(3,2),'n':(4,2),\n",
-    "        'o':(0,3),'p':(1,3),          'q':(3,3),          \n",
+    "        'o':(0,3),'p':(1,3),          'q':(3,3),\n",
     "    }\n",
-    "    return ch\n"
+    "    return ch"
    ]
   },
   {
@@ -1207,13 +1207,13 @@
     "#export\n",
     "def commit_graph():\n",
     "    \"\"\"Create an example of Git commit graph\n",
-    "    \n",
+    "\n",
     "    This graph is taken from Derrick Stolee series of blog posts\n",
     "    \"Supercharging the Git Commit Graph\".\n",
-    "    \n",
+    "\n",
     "    Positions of nodes in the drawing from `commit-graph-example.png`\n",
     "    is stored in `pos` attribute of returned graph object.\n",
-    "    \n",
+    "\n",
     "    Returns\n",
     "    -------\n",
     "    graph : networkx.DiGraph\n",
@@ -1231,14 +1231,14 @@
     "                       ('b5','c4'),\n",
     "                       ('c3','b2'),('b2','a1'),\n",
     "                      ])\n",
-    "    \n",
+    "\n",
     "    cg.pos={'b0':(0,1),'b1':(1,1),'b2':(2,1),'b3':(3,1),'b4':(4,1),'b5':(5,1),'b6':(6,1),'b7':(7,1),'B':(8,1),\n",
     "                       'a1':(1,0),'a2':(2,0),'a3':(3,0),'a4':(4,0),'a5':(5,0),           'a7':(7,0),'A':(8,0),\n",
     "                       'c1':(1,2),           'c3':(3,2),'c4':(4,2),'c5':(5,2),'c6':(6,2),'c7':(7,2),\n",
     "                                                                   'd5':(5,3),\n",
     "           }\n",
-    "    \n",
-    "    return cg\n"
+    "\n",
+    "    return cg"
    ]
   },
   {