WEEK-03


Given the following adjacency matrix that represents a directed graph, apply a topological sort using Depth First Search (DFS) and determine the start and finish times for each node. Start from node 'a' and always prioritize visiting nodes in alphabetical order. abcdefga0100000b0010100c0001000d0000101e0000010f0000000g0000010
  1. a(1,14); b(2,13); c(3,12); d(4,11); e(5,10); f(6,7); g(5,8)
  2. a(1,14); b(2,13); c(3,12); d(4,11); e(5,7); f(6,9); g(8,10)
  3. a(1,14); b(2,13); c(3,12); d(4,11); e(5,10); f(7,8); g(6,9)
  4. a(1,14); b(2,13); c(3,12); d(4,11); e(5,8); f(6,7); g(9,10)
  5. None of the above
Original idea by: Thaysa Bello

Comentários

  1. Joao Meidanis25 de março de 2023 às 07:41

    Good question. I took it. Please state exactly what the 1's mean in your matrix, as it seems to be the reverse of what's in the book (e.g., a -> b or b -> a).

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

WEEK-01

Imagem
  Five examples are given, each consisting of an adjacency matrix, a graph, and a degree distribution. Example ID Adjacency Matrix Graph Degree Distribution Example I A=[0101110110010101110010000] Example II A=[0100110100010100010110010] Example III \begin{equation*} A ...
Leia mais

WEEK-06

Consider a scale-free network with a power-law degree distribution, where the degree exponent is exactly the mean between 2 and 3. The network starts with 1000 nodes, where some nodes have exactly 2 connections and others have more than 2 connections. After some time, the number of nodes grows to be 10 times bigger, and now the minimum degree is 4. By what percentage did k max grow from the initial network to the larger network? k max grows by approximately 100%. k max decreases by approximately 100%. k max grows by approximately 200%. k max decreases by approximately 200%. None of the above Original idea by: Thaysa Bello
Leia mais