What is the order in which the nodes of the directed graph are discovered in a depth$-$first search starting

from node A$?$ When you have the choice of two or more nodes according to the DFS algorithm, break ties

by choosing the node whose label comes first in the alphabet.

ABCEFGIJLMDKH

ABEIDHJCFLKMG

ACBEFJMILGDKH

ACBDFEHKJIMLG

ABDHIEJCFKLMG

ACBFEJMLIGKDH

ABCDEFGHIJKLMAlso, don't let the geometry of the graph deceive you. You may not always go from a node high in the

graph down to one lower in the graph.