You are viewing a single comment's thread.
Return to all comments →
2 years ago
+ 2 comments
Find terminal nodes (leaf nodes are they called?) - They will be the nodes that have only one adjascent node.
Find the direct parents of these nodes
Out of point
find those direct parents which have more than T leaf nodes
Substract from n (total number of vertices) the count of all standalone nodes, plus the sum of the excess leaf nodes from point
You are viewing a single comment's thread. Return to all comments →