Concerning graph algorithms, match column 1 with column 2. I - Minimum Spanning Tree (Prim) II - Shortest Path (Dijkstra) III - Minimum Spanning Tr...
I - Minimum Spanning Tree (Prim)
II - Shortest Path (Dijkstra)
III - Minimum Spanning Tree (Kruskal)
A - Takes as input an undirected graph with weighted edges, sorts the edges by weight, and chooses the edges in a way that does not close cycles to solve the problem.
B - Takes as input an undirected graph with weighted edges, basically uses breadth-first search choosing edges of smaller weight to solve the problem.
C - Takes as input an undirected graph with weighted edges, basically uses breadth-first search choosing accumulated distances of smaller weight to solve the problem.
a) I-A, II-B, III-C
b) I-B, II-C, III-A
c) I-C, II-A, III-B
💡 1 Resposta
Ed 
A alternativa correta é a letra b) I-B, II-C, III-A: - I - Minimum Spanning Tree (Prim) - A - Takes as input an undirected graph with weighted edges, sorts the edges by weight, and chooses the edges in a way that does not close cycles to solve the problem. - II - Shortest Path (Dijkstra) - C - Takes as input an undirected graph with weighted edges, basically uses breadth-first search choosing accumulated distances of smaller weight to solve the problem. - III - Minimum Spanning Tree (Kruskal) - A - Takes as input an undirected graph with weighted edges, sorts the edges by weight, and chooses the edges in a way that does not close cycles to solve the problem.
Faça como milhares de estudantes: teste grátis o Passei Direto
Esse e outros conteúdos desbloqueados
16 milhões de materiais de várias disciplinas
Impressão de materiais
Agora você pode testar o
Passei Direto grátis
✏️ Responder
Para escrever sua resposta aqui, entre ou crie uma conta
Outros materiais
Perguntas relacionadas
Compartilhar