In a depth-first traversal of a graph G with 9 vertices and 3 connected components, a graph G has ______ edges.
Enter numerical value using the virtual keypad. Round off where necessary.
In a depth-first traversal of a graph G with 9 vertices and 3 connected components, a graph G has ______ edges.
Enter numerical value using the virtual keypad. Round off where necessary.