Analyze the edges of the given DIRECTED graph by applying DFS starting from the given "startVertex" and count the occurrence of each type of edges (backward, forward & cross)
NOTE: during search, break ties (if any) by selecting the vertices in ASCENDING alpha-numeric order
