Embed presentation
Download to read offline

The document outlines a task to perform a depth-first search (DFS) on a directed graph, initiating from vertex v1. It instructs to mark all vertices and edges in the order of visitation, with a specific tie-breaking rule by alphabetical order. The objective is to identify and highlight the edges that are part of the DFS tree.
