Solve the Travel Salesperson Problem for the following undirected weighted graph and pick the best answer:

A) Path ABCDEA and length 24
B) Path ABCEDA and length 20
C) Path ADEBCA and length 18
D) Path AEBCDA and length 19
E) None of the above

Original question by: Raphael Adamski
Original images from https://graphicmaths.com/computer-science/graph-theory/travelling-salesman-problem/

Comentários

  1. Joao Meidanis2 de novembro de 2025 às 02:45

    Boa questão. Fico com ela. Só mudei path para cycle e length para weight.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Given the properties of BFS (Breadth First Search) and DFS (Depth First Search) algorithms, select the most suitable algorithm for each application: Find the shortest path between 2 nodes Cycle detection Strongly connected components detection Bipartite graphs A) BFS - DFS - DFS - BFS B) BFS - DFS - DFS - BFS C) BFS - BFS - DFS - DFS D) DFS - BFS - DFS - BFS E) None of the above
Leia mais
About Strongly Connected Components (SCC) concepts and Kosaraju-Sharir's algorithm, please select the correct answer regarding the three statements:  Kosaraju-Sharir's algorithm allow us to convert a direct cyclic graph into a directed acyclic graph (DAG) The advantage of detecting SCC in graphs is to be able to apply topologically ordering over any graph, even if there are cycles. Kosaraju-Sharir's algorithm is the only algorithm to find SCC in DAGs A) True-True-False B) True-False-True C) False-True-False D) True-False-False E) None of the above 
Leia mais