2024-08-16 Question
Given the following directed graph:
Which sequence represents a valid depth-first search (DFS) traversal path that involve only one tree?
A. a-d-b-f-c-e
B. a-d-f-b-e-c
C. e-c-d-f-b-a
D. c-d-b-a-f-e
E. None of the above
2024-08-30 Question
Consider an Erdos-Renyi random graph G(200, p ) with 200 nodes. Which value of p would ensure an average degree of separation (average path length) between nodes greater than 5? A. 0.01 B. 0.025 C. 0.04 D. 0.05 E. None of the above Original idea by Darlinne Hubert Palo Soto
Great question. I'll take it.
ResponderBorrar