So Far:
| Name | Description | Attributes |
|----------------------------|------------------------------------------------------------------|-----------------------|
| directedGraph | Directed Graph Class | Class |
| DFS | Depth First Search for both types of graphs | Function |
| getNeigh | Function that returns the adjacency nodes from a node in a graph | Function |
| un/directedGraph.isCycle() | A directedGraph method that search the graph for cycles | Class Method/Function |
+ Also the **BFS/DFS algorithm** was **upgraded** with another parameter,that the users can use if they want to print the result or save it into a variable.