From 03cbfceb3af500dc1aea09d5213e78639a433521 Mon Sep 17 00:00:00 2001
From: Philipp Muens <raute1337@gmx.de>
Date: Thu, 6 Apr 2017 13:21:52 +0200
Subject: [PATCH 1/2] Fix README formatting

---
 README.md | 62 ++++++++++++++++++++++++++++---------------------------
 1 file changed, 32 insertions(+), 30 deletions(-)

diff --git a/README.md b/README.md
index a7a04b7..05ddb78 100644
--- a/README.md
+++ b/README.md
@@ -5,16 +5,16 @@ described in http://www.library.uu.nl/digiarchief/dip/diss/1895620/inhoud.htm.
 
 This implementation is still in beta and is not yet optimized for large networks.
 
-![example] (example.png)
+![example](example.png)
 
 
-##Installation
+## Installation
 
-python setup.py install
+`python setup.py install`
 
-##Usage
+## Usage
 
-###Command line
+### Command line
 
     Usage: mcl_clustering.py [options] <input_matrix>
 
@@ -43,42 +43,44 @@ try:
     mcl_clustering.py -d -e 3 <example_path>/example.csv
 
 
-###Code
+### Code
         
-####Using numpy adjacency matrix
+#### Using numpy adjacency matrix
 
-    from mcl_clustering import mcl
+```python
+from mcl_clustering import mcl
 
-    A = <your matrix>
+A = <your matrix>
 
-    M, clusters = mcl(A, expand_factor = <expand_factor>,
-                       inflate_factor = <inflate_factor>,
-                       max_loop = <max_loop>,
-                       mult_factor = <mult_factor>)
+M, clusters = mcl(A, expand_factor = <expand_factor>,
+    inflate_factor = <inflate_factor>,
+    max_loop = <max_loop>,
+    mult_factor = <mult_factor>)
+```
 
-####Using a networkx graph
+#### Using a networkx graph
 
-    from mcl_clustering import networkx_mcl
+```python
+from mcl_clustering import networkx_mcl
 
-    G = <your graph>
+G = <your graph>
 
-    M, clusters = networkx_mcl(G, expand_factor = <expand_factor>,
-                       inflate_factor = <inflate_factor>,
-                       max_loop = <max_loop>,
-                       mult_factor = <mult_factor>)
+M, clusters = networkx_mcl(G, expand_factor = <expand_factor>,
+    inflate_factor = <inflate_factor>,
+    max_loop = <max_loop>,
+    mult_factor = <mult_factor>)
 
-    
-    Output
-        M = otuput matrix
-        clusters = dict with keys = [<cluster id>] values = [<vertex id>]
+Output
+    M = otuput matrix
+    clusters = dict with keys = [<cluster id>] values = [<vertex id>]
+```
 
-##Requirements
+## Requirements
     
-    numpy
-    networkx
-
+- numpy
+- networkx
 
-##References
+## References
 
 * [1]   Stijn van Dongen, Graph Clustering by Flow Simulation.
       PhD thesis, University of Utrecht, May 2000.
@@ -90,6 +92,6 @@ try:
       ( http://www.cwi.nl/ftp/CWIreports/INS/INS-R0010.ps.Z )
 
 
-# license
+# License
 
 MIT

From 75d6dc54940d802f8ac735947ff311d3168adf2a Mon Sep 17 00:00:00 2001
From: Philipp Muens <raute1337@gmx.de>
Date: Thu, 6 Apr 2017 13:23:33 +0200
Subject: [PATCH 2/2] Additional formatting fixes

---
 README.md | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/README.md b/README.md
index 05ddb78..d6f7ffa 100644
--- a/README.md
+++ b/README.md
@@ -39,9 +39,7 @@ adjacency matrix.
 
 An example is the file example.csv in examples dir.
 
-try: 
-    mcl_clustering.py -d -e 3 <example_path>/example.csv
-
+try: `mcl_clustering.py -d -e 3 <example_path>/example.csv`
 
 ### Code
         
@@ -91,7 +89,6 @@ Output
       Science in the Netherlands, Amsterdam, May 2000.
       ( http://www.cwi.nl/ftp/CWIreports/INS/INS-R0010.ps.Z )
 
-
 # License
 
 MIT