Find parent node of a tree to create the shortest possible tree height

Question

I have an undirected graph represented as an adjacency matrix of Euclidean weights. I'm using this to represent the minimum spanning tree for a larger complete graph.

What I want to find is the single node within the graph that, when used as the root node, creates the shortest possible tree height. What I've come up with is performing a depth-first traversal using every node as the root, and keeping track of the shortest height seen. Is there a faster way to accomplish this?

score 2 · Accepted Answer · edited May 23 '17 at 10:29

2

This is a classic algorithms question. What you're looking for is called the center of the tree, and it can be found using a simple iterative algorithm. This question has a great answer that explains how to do it.

Hope this helps!

edited May 23 '17 at 10:29

Community

1
1

answered Apr 01 '11 at 17:58

templatetypedef

362,284
104
897
1,065

Find parent node of a tree to create the shortest possible tree height

1 Answers1