Questão 1

 

Consider the Depth-First Search (DFS) algorithm applied to a directed graph. Determine whether the following statements are true or false:

1-     1- In the DFS algorithm, if a vertex is visited, it will never be revisited. Therefore, by the end of the algorithm's execution, all vertices in the graph will have been visited once, assuming the graph is connected.

2-     2- When a vertex u is explored in DFS, its neighbors are explored in an order that depends on the graph structure. If a vertex v is a neighbor of u and has not been visited yet, it will be visited immediately after u. 

3-     3- In DFS, the order in which vertices are visited can be used to construct a cycle and detect if a graph contains cycles.

Mark which alternatives are correct:

a- 1 and 2

b- 2 and 3

c- 3

d- 1 and 3

e- None of the above

Comentários

  1. Joao Meidanis21 de agosto de 2024 às 12:51

    Interesting question, but statement (3) is a bit confusing. If there is no cycle, the DFS cannot construct a cycle as mentioned, can it?

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Question 3 - Scale-free networks

  According to the book Network science by Albert-Lászlo Barabási,   the scale-free network property refers to:   A - A network in which all nodes have the same number of connections (degree). B - A network where the degree of all nodes follows a normal distribution. C - A network where most nodes have few connections, while a few highly connected nodes (hubs) have many connections. D - A network in which the number of connections between nodes grows exponentially over time E – None of above Original idea by: Vanessa Alves
Leia mais

Question 4 - Barabási model

 In the  Barabási-Albert model  for generating graphs, the probability  P ( k )  that a vertex has degree  k  follows a power-law distribution,  P (k)≈2m (1/ β ) k (− γ ) ,   where γ  is a network parameter, γ=1/(β+1), and β is the dynamical exponent  . Based on this model, which of the following statements is correct? A - The probability that a vertex is connected to another is given by  P ( k ) = 1/ k , regardless of the vertex's degree. B - In the Barabási-Albert model, the probability of a new vertex connecting to an existing vertex with degree  ki  is proportional to  k i /∑ k j . C - The degree distribution in the Barabási-Albert model follows an exponential distribution given by  P ( k ) ∼ e ^(− k ) . D - In the Barabási-Albert model, the average degree of the vertices grows exponentially with the number of vertices  N N , i.e.,  ⟨ k ⟩ ∼ e ^(N ) . E - None of above Original idea by: Vanessa Alves
Leia mais