Back to General and Gameplay Programming

Trees and depth

jtech · 2002-02-28T13:32:48

Given an arbitrary tree (not necessarily binary) that has nodes with random weights (e.g. distances from each other), how would I find the root or center node? This would ideally minimize the height of the tree.

General and Gameplay Programming Programming

Started by jtech February 21, 2002 11:27 PM

20 comments, last by jtech 22 years, 1 month ago

bishop_pass

112

February 28, 2002 12:32 AM

Well, gosh darn it. I think I provided a solution above. Is anybody going to comment on it, criticize it, or at least thank me?

_______________________________
"To understand the horse you'll find that you're going to be working on yourself. The horse will give you the answers and he will question you to see if you are sure or not."
- Ray Hunt, in Think Harmony With Horses
ALU - SHRDLU - WORDNET - CYC - SWALE - AM - CD - J.M. - K.S. | CAA - BCHA - AQHA - APHA - R.H. - T.D. | 395 - SPS - GORDIE - SCMA - R.M. - G.R. - V.C. - C.F.

jtech

108

Author

February 28, 2002 01:32 PM

I''m still trying to figure it out

I got the code written to find the max num of descendants for
each node, but the second part is little murky.

Here''s what I got:

  typedef struct _NODE { INT num_nodes; struct _NODE *nodes;} NODE;INTGet_Num_Descendants( NODE *parent, INT parent_depth ) { if(NULL == parent) {    return parent_depth; } INT max=0; for(INT i=0; i < parent->num_nodes; i++) {     if(parent->nodes[i]) {       INT d = Get_Num_Descendants( parent->nodes[i], (parent_depth+1) );       max = MAX( max, d );    } } max = MAX( max, parent_depth ); return max;}

Trees and depth

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Trees and depth

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Reticulating splines