depth
Retrieves the depth of the graph from the most recent search operation
Depth is defined as the deepest level of recursion or the maximum distance from the starting node to any other node during the search traversal if the weights are counted as 1.
Return
The depth of the graph.
Throws
Illegal
If neither DFS nor BFS has been run yet.