Question refactor

 Hi professor, for this week quiz, I have refactored the network flow question.

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Network Flow

Considering the definitions of Network Flow , please select the INCORRECT affirmation below: A.  There are two types of special nodes, Source and Sink. B. The flow-conservation property says that the total flow  into a node other than the source or sink must equal the total flow out of that  node (flow in equals flow out). C. Between two nodes ( A and B ), links flowing in opposite directions (antiparallel edges) are allowed ( A to B , and B to A ). D. Multiple edges (Parallel edges, i.e., same directions) between two nodes are allowed (Same start and end nodes). E. None of the above. Original idea by: Felipe Crispim da Rocha Salvagnini
Leia mais

Depth-First Search (DFS) Algorithm for Topological Sorting

Imagem
One could use the DFS Algorithm to identify the safe order for tasks execution (i.e., for tasks that depend on previous ones), also known as topological sort. Please, select the option that shows which of the following directed graphs above could have its topological order extracted through DFS. I) II) III) Consider the usage of only the DFS algorithm, without additional algorithms to detect strongly connected components and deal with cyclic graphs. A. I. B. I, and III. C.  I, II, and III. D. III. E. None of the above. Original idea by: Felipe Crispim da Rocha Salvagnini
Leia mais