Provide implementation for these in Graph Class - Breadth First - Depth First - Dijkstra’s algorithm - A* - Best First Search - Greedy Best First Search Wrote description in readme file Wrote tests for Int, Double or String template for Graph