VCE Algorithmics (HESS)

VCE Algorithmics (HESS) External Assessment

Algorithm DesignEnglish
Exam overview

Practice session

Running Breadth-First Search (BFS) on an unweighted graph G starting from source vertex s guarantees which of the following properties when a vertex v is first visited?

Loading your practice session…