原题：The radius of a tree is the maximum distance from the root to a leaf. Given a connected, undirected graph, write a procedure to find a spanning tree of minimum radius. (Hint: use breadth-first search)
Tip: Use breadth-first algorithm (basically ensures that the generated tree has a minimum radius)
Basically traverse the graph breadth-first, then put the traversed nodes on the tree and mark them so that you don’t visit the traversed nodes next time. You can consider using a linked list to store visited nodes.
You can first read the explanations of BFS and DFS and related implementations on Wikipedia.
Starting from the root node, find the nearest and unvisited node each time. Next time start with all these nodes and continue repeating the above process.
Minimum spanning tree can also refer to the related algorithms of MST, prim, kruskal (I don’t know if there are any spelling errors).
Read more classic questions, and similar problems like this will be easily solved.
Isn’t it a minimum radius spanning tree after running BFS? Use adjacency list to save the image.vector<int>g[SIZE]. There is also a minimum spanning tree (generally refers to the smallest value)
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
Tip: Use breadth-first algorithm (basically ensures that the generated tree has a minimum radius)
Basically traverse the graph breadth-first, then put the traversed nodes on the tree and mark them so that you don’t visit the traversed nodes next time. You can consider using a linked list to store visited nodes.
You can first read the explanations of BFS and DFS and related implementations on Wikipedia.
Starting from the root node, find the nearest and unvisited node each time. Next time start with all these nodes and continue repeating the above process.
Minimum spanning tree can also refer to the related algorithms of MST, prim, kruskal (I don’t know if there are any spelling errors).
Read more classic questions, and similar problems like this will be easily solved.
Isn’t it a minimum radius spanning tree after running BFS?
Use adjacency list to save the image.vector<int>g[SIZE].
There is also a minimum spanning tree (generally refers to the smallest value)