Update Examples

Author: sarangbishal

Examples.md

@@ -34,30 +34,37 @@ def fib(n):
 
 Now we want to draw the recursion tree for this function. It is as simple as adding a decorator  
 ```python  
-# Author: Bishal Sarang  
-  
-# Import Visualiser class from visualiser.visualiser module
-from visualiser.visualiser import Visualiser as vs 
-  
-# Add decorator  
-# Decorator accepts arguments: ignore_args and show_argument_name  
-@vs(ignore_args=['node_num'])  
-def fib(n, node_num):  
-	if n <= 1: 
-		return n     
-	# Increment decorator class node_count before each function calls  
-	vs.node_count += 1 
-	left = fib(n=n - 1, node_num=vs.node_count)  
-	
-    # node_count is incremented  
-	vs.node_count += 1 right = fib(n=n - 2, node_num=vs.node_count)  
-	return left + right  
+# Author: Bishal Sarang
 
-# Call function  
-print(fib(n=6, node_num=0))  
-  
-# Save recursion tree to a file  
-vs.write_image("fibonacci.png")  
+# Import Visualiser class from module visualiser
+from visualiser.visualiser import Visualiser as vs
+
+
+# Add decorator
+# Decorator accepts arguments: ignore_args and show_argument_name
+@vs(ignore_args=['node_num'])
+def fib(n, node_num):
+    if n <= 1:
+        return n
+    # Increment node count
+    vs.node_count += 1
+    left = fib(n=n - 1, node_num=vs.node_count)
+    
+    # Increment node count
+    vs.node_count += 1
+    right = fib(n=n - 2, node_num=vs.node_count)
+    return left + right
+
+def main():
+    # Call function
+    print(fib(n=6, node_num=0))
+
+    # Save recursion tree to a file
+    vs.write_image("fibonacci.png")
+
+
+if __name__ == "__main__":
+    main()
 ```  
 Here are the changes required:  
 

README.md

@@ -17,9 +17,13 @@ def fib(n, node_num):
     right = fib(n=n - 2, node_num=vs.node_count)
     return left + right
 
-if __name__ == "__main__":
+def main():
     # Call function
     print(fib(n=6, node_num=0))
 
     # Save recursion tree to a file
-    vs.write_image("fibonacci.png")
+    vs.write_image("fibonacci.png")
+
+
+if __name__ == "__main__":
+    main()

examples/fibonacci.png

@@ -108,7 +108,7 @@ def wrapper(*args, **kwargs):
             self.graph.add_node(child_node)
 
             # If the function is called by another function
-            if caller_function_name != '<module>':
+            if caller_function_name not in ['<module>', 'main']:
                 print(f"Called {current_function_label} by {caller_func_label}")
 
                 parent_node = pydot.Node(name=caller_func_signature, label=caller_func_label)
@@ -117,3 +117,25 @@ def wrapper(*args, **kwargs):
                 self.graph.add_edge(edge)
             return result
         return wrapper
+
+@Visualiser(ignore_args=["node_num"])
+def fib(n, node_num):
+    if n <= 1:
+        return n
+    Visualiser.node_count += 1
+    left = fib(n=n - 1, node_num=Visualiser.node_count)
+
+    Visualiser.node_count += 1
+    right = fib(n=n - 2, node_num=Visualiser.node_count)
+    return left + right
+
+def main():
+    # Call function
+    print(fib(n=6, node_num=0))
+
+    # Save recursion tree to a file
+    Visualiser.write_image("fibonacci.png")
+
+
+if __name__ == "__main__":
+    main()