Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>If I understand what you want to say ( each node at level i has n(i) children) then is very simple : The first number is the root fallowed by n(0) elements that are the root's children , then you put for all those n(0) nods all their n(1) nodes. If you have n(0) = 3 then for the first you put n(1) nods, after them you put all the n(1) nods if the second nod, and and after those the n(1) nods for the 3rd nod</p> <pre><code>1 -&gt; 2, 5, 3 ( 1 is the root, and has 2, 5, 3 as children) 2 -&gt; 4, 10 3 -&gt; 45, 35 5-&gt; 12, 31 n(0) = 3, n(1) = 2 , n(2) = 0 Then You should have: {1, 2, 5, 3, 4, 10, 45, 35, 12, 31} </code></pre> <p>For a good index you should keep another array with the father position and another with the first child index or if you realy want to have just one array you should do this:<br> For each element keep 3 things: the father index and the first child index. Because the child are one after another you will allways have access to all the children and you will allways have the father. ( I will put -1 for the root's father) Then you should have : </p> <pre><code>{1,-1, 3, 2, 0,12, 5, 0, x, 3, 0, x, 4, 3, x, ... } {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, ... } -1 is the father of 1 and 3 is the start of his child 0 is the father of 1 and 12 is the start of his child ( 4 in this case) </code></pre> <p>If you want a "heap" structure you have to find the largest number of children Mx = ( max(n(i)), 1&lt;=i&lt;=N and do a heap with step MX, each element will have their children at pos*MX, pos*MX + 1, ..pos*MX + n(k), and the father at pos/MX, where the pos is the index of the node. <br> You will have a lot of free spaces but is a heap-like stuture<br> I hope it helps you.</p>
    singulars
    1. This table or related slice is empty.
    1. POHow to store an arborescent tree in array?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USMark
    1. USMark
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUndeletion
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThanks. Thing is, I would like to avoid "storing" the father and child indices, but rather compute them from the current index. Will edit question to clarify.
      singulars
      1. PO
      1. USwillem
    2. CO@willem see how if it's what you want( the last paragraph )
      singulars
      1. PO
      1. USMark
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload