sexta-feira, 6 de setembro de 2024

 Consider an undirected graph G=(V,E), where V={A,B,C,D,E,F} and the edges are E={(A,B),(A,C),(B,D),(C,D),(C,E),(D,F),(E,F)}. Starting from vertex A, which of the following sequences represents the correct order of vertex visits by the BFS? 


a) A,B,C,D,E,F

b) A,C,B,E,D,F

c)A,B,C,D,F,E

d)A,C,B,D,F,E

e) A,B,C,E,D,F


Original idea by Thalia Anastácia da Silva Araujo

às

Um comentário:

Assinar: Postar comentários (Atom)

 Consider a simple, undirected graph  G with n vertices and  m edges. Let  d ( v ) denote the degree of vertex v in  G . The degree distr...

  • (nenhum título)
      That's an X-ray of a very worried person. This is Kenzo. Kenzo is very worried about his research future in the graphs field. So worri...
  • (nenhum título)
     Consider an undirected graph G=(V,E), where V={A,B,C,D,E,F} and the edges are E={(A,B),(A,C),(B,D),(C,D),(C,E),(D,F),(E,F)}. Starting from ...
  • (nenhum título)
    Consider a network modeled by a connected, undirected graph G = ( V , E ) G = (V, E) , where each vertex v i ∈ V represents a node, and each...