How do minimal tree generators work?

  • Thread starter Thread starter esmeco
  • Start date Start date
  • Tags Tags
    Generators Tree
AI Thread Summary
Minimal tree generators operate by managing two sets of nodes: Remaining Nodes (A) and Visited Nodes (B). The process begins with the minimal edge, defined as the one with the smallest weight, and iterates until no more nodes can be connected. The key criterion for transferring a node from A to B is the minimal edge connecting the two sets. Kruskal's algorithm is mentioned as an alternative approach, which starts with no edges and adds the smallest-weight edge that avoids cycles. Overall, these algorithms are rooted in graph theory and discrete mathematics.
esmeco
Messages
144
Reaction score
0
I was wondering,could someone explain me how do minimal tree generators work?
 
Mathematics news on Phys.org
Is this a Graph Theory or discrete math topic? Is it the minimal tree of the entire graph or connected to some node? mathworld.com

either way its about having 2 sets...the set of Remaining Nodes A and the set of nodes you have visited B. The idea is to move nodes in A to B. The algorithm will always start off with the minimal edge(one with the smallest weight). From there you iterate till no more nodes can be connected to B or A is empty. The criteria for moving a node from A to B is simply the minimal edge that connects A to B.
 
Kruskal's algorithm works differently, starting with no edges and continuing to add the smallest-weight edge that does not form a cycle.
 
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top