João Augusto

Select one correct alternative about the BFS algorithm:  a) BFS uses a stack to store the vertices to be explored. b) A BFS can be used to find a path from one vertex to another in an unweighted graph, but it does not guarantee that this path is the shortest possible. c) A BFS can be used in undirected unweighted graphs to determine the distance between an initial vertex and all other vertices that make up the same connected component. d) A BFS is used in weighted graphs to determine the shortest path between a vertex and all others. e) None of the above. Original idea by: João Augusto Ferreira de Moura

  Observing the directed graph bellow From which vertices should the DFS start so that all vertices are visited at least once. a) 5 and 3 b) 4 and 2 c) 6 and 3 d) 6 and 2 e) none of the above