Add LICENSE.md and CONTRIBUTING.md

Author: sarangbishal

CONTRIBUTING.md

@@ -0,0 +1,4 @@
+# Recursion Visualiser Examples:
+In this example series, I'm going to start with making minimal recursion tree to making some complex recursion tree.
+
+Let's start with first example:

Examples.md

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Bishal Sarangkoti
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

LICENSE.md

@@ -1,4 +1,7 @@
 # Recursion Visualiser  
+
+![](https://forthebadge.com/images/badges/made-with-python.svg)
+
 Recursion visualiser is a python tool that visualizes recursion tree with animation and draws recursion tree for recursive function.
 It works with almost any type of recursive function.
 Just add the recursion-visualiser decorator to your function and let it do the rest of the work.
@@ -45,8 +48,8 @@ Now we want to draw the recursion tree for this function. It is as simple as add
 from visualiser.visualiser import Visualiser as vs
 
 # Add decorator
-# Decorator accepts arguments: ignore_args and show_argument_name
-@vs()
+# Decorator accepts optional arguments: ignore_args , show_argument_name, show_return_value and node_properties_kwargs
+@vs(node_properties_kwargs={"shape":"record", "color":"#f57542", "style":"filled", "fillcolor":"grey"})
 def fib(n):
     if n <= 1:
         return n
@@ -73,9 +76,9 @@ Here are the changes required:
 
 Here is how the recursion tree looks like:  
 Animation:
-![enter image description here](https://github.com/sarangbishal/Recursion-Visualizer/blob/master/examples/fibonacci.gif)  
+![enter image description here](https://raw.githubusercontent.com/sarangbishal/Recursion-Tree-Visualizer/master/examples/fibonacci.gif)  
 
-![enter image description here](https://github.com/sarangbishal/Recursion-Visualizer/blob/master/examples/fibonacci.png)  
+![enter image description here](https://raw.githubusercontent.com/sarangbishal/Recursion-Tree-Visualizer/master/examples/fibonacci.png)  
 
 Find other examples : [here](https://github.com/sarangbishal/Recursion-Tree-Visualizer/tree/master/examples)
 and read more about **recursion-visualiser** [here](https://github.com/sarangbishal/Recursion-Tree-Visualizer/blob/master/Examples.md)
@@ -87,7 +90,7 @@ and read more about **recursion-visualiser** [here](https://github.com/sarangbis
  - [x] Add node styles
  - [ ] Support aliasing for function name
  - [ ] Show repeated states
- - [ ] Support node_color, backgroundcolor etc
+ - [x] Support node_color, backgroundcolor etc
  - [ ] Refactor  
  - [ ] Handle base cases  
  - [ ] Make more beautiful trees

README.md

@@ -0,0 +1,16 @@
+from visualiser.visualiser import Visualiser as vs
+
+"""
+Problem Link: https://stackoverflow.com/questions/33808653/recursion-tree-with-fibonacci-python/60126306#60126306
+"""
+
+@vs(node_properties_kwargs={"shape":"record", "color":"#f57542", "style":"filled", "fillcolor":"grey"})
+def binary(length, outstr=""):
+    if len(outstr) == length:
+        print(outstr)
+    else:
+        for i in ["0", "1"]:
+            binary(length=length, outstr=outstr + i)
+
+binary(length=3,outstr="")
+vs.make_animation("binary_string.gif", delay=2)

examples/binary_string.gif

@@ -0,0 +1,23 @@
+# Author: Bishal Sarang
+
+# Import Visualiser class from module visualiser
+from visualiser.visualiser import Visualiser as vs
+
+# Add decorator
+# Decorator accepts optional arguments: ignore_args , show_argument_name, show_return_value and node_properties_kwargs
+@vs()
+def fact(n):
+    if n <= 1:
+        return n
+    return n * fact(n=n-1)
+
+
+def main():
+    # Call function
+    print(fact(n=6))
+    # Save recursion tree to a file
+    vs.make_animation("factorial.gif", delay=2)
+
+
+if __name__ == "__main__":
+    main()