Pseudo-Distances within a depth-determination problem

  • Thread starter Thread starter Shaitan00
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around understanding the concept of "pseudo-distance" in a depth-determination problem involving rooted trees and disjoint-set forests. Participants are trying to clarify how the pseudo-distance relates to calculating node depths in a tree structure.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant expresses confusion about the application of the "pseudo-distance" feature and requests a simple example to illustrate its use.
  • Another participant notes that the definition of "pseudo-distance" appears to be recursive and questions the clarity of the problem wording.
  • A different participant suggests that if Si is a subtree of Ti, it is unclear how d[v] in Si can be used to calculate the depth in Ti, indicating a potential misunderstanding or misinterpretation of the problem.
  • Another participant provides an analogy to highlight the issue with recursive definitions, suggesting that such definitions may not effectively clarify concepts.
  • One participant acknowledges the concern but emphasizes that the definition is taken directly from the textbook, indicating a reliance on the provided material.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the clarity of the definition of "pseudo-distance" or its implications for depth calculation. Multiple competing interpretations and uncertainties remain regarding the problem's wording and the relationship between Si and Ti.

Contextual Notes

The discussion highlights potential limitations in the problem statement, particularly regarding the recursive nature of the definition and its implications for understanding the depth calculation.

Shaitan00
Messages
13
Reaction score
0
I was given the following problem description for a depth-determination problem, however I am completely unable to figure out how this "pseudo-distance" feature works, if anyone has any clues and can provide a uber-simple example it would be much appreciated - I just can't see how it works/applies.

[Problem]
In the depth-determination problem, we maintain a forest F = {Ti} of rooted trees. We use the disjoint-set forest S=Si, where each set Si (which is itself a tree) corresponds to a tree Ti in the forest F. The tree structure within a set Si, however, does not necessarily correspond to that of Ti. In fact, the implementation of Si does not record the exact parent-child relationships but nevertheless allows us to determine any node’s depth in Ti.

The key idea is to maintain each node v a ”pseudo-distance” d[v], which is defined so that the sum of the pseudo-distances along the path from v to the root of its set Si equals the depth of v in Ti. That is, if the path from v to its root in v0 , v1 , . . . , vk , where v0 = v and vk is Si’s root, then the depth of v in Ti is the sum of d[vj] where j=0 to j=k.
 
Physics news on Phys.org
The key idea is to maintain each node v a ”pseudo-distance” d[v], which is defined so that the sum of the pseudo-distances along the path from v to the root of its set Si equals the depth of v in Ti.
The definition of "pseudo-distance" seems to be recursive here. Could you check the wording of the question?
 
Very possible that is it recursive - because the wording is copy/paste from the problem statement - I just don't see how it works...

If Si is a subtree of Ti (but they don't necessarily have the same root) then how can d[v] in Si allow you to calculate the depth it Ti? Or am I looking at this completely wrong?

Thanks,
 
It is common to have a recursive algorithm. But a definition that is recursive would not help the cause of defining or explaining something.
For example:
"A rectangle is a rectangle that has opposite sides parallel and adjacent side perpendicular to each other."
is a faulty definition.
 
I see your point - but this is given in the textbook, not sure how else to interpret it...
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
Replies
15
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 25 ·
Replies
25
Views
5K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K