Handling smaller trees representing branches of the big tree
up vote
0
down vote
favorite
I have a very big tree. Is it problematic if instead of keeping that big tree my program concurrently handles many smaller trees representing branches of that big tree?
Knowing I wouldn’t decide where the branches are cut from to make this the most efficiently but this would be imposed on me (so I’d end up dealing with many smaller trees of unequal size pointing to each other). The goal is to handle the capacity of the same branches (not copies of their contents nor links) to concurently exist at different locations in the tree.
algorithm data-structures tree branch
asked Nov 13 at 1:15
Anskulainen
155
add a comment |
up vote
0
down vote
favorite
I have a very big tree. Is it problematic if instead of keeping that big tree my program concurrently handles many smaller trees representing branches of that big tree?
Knowing I wouldn’t decide where the branches are cut from to make this the most efficiently but this would be imposed on me (so I’d end up dealing with many smaller trees of unequal size pointing to each other). The goal is to handle the capacity of the same branches (not copies of their contents nor links) to concurently exist at different locations in the tree.
algorithm data-structures tree branch
asked Nov 13 at 1:15
Anskulainen
155
Are you thinking of a recursive divide and conquer algorithm? If so, then that is not at all problematic - quite the opposite! Otherwise, could you maybe add some code / pseudo code that demonstrates what you are trying to do?
– runcoderun
Nov 13 at 8:01
1
@runcoderun Branches would be iterated upon by a human user, nodes added or deleted, children re-ordered under their parent, entire branches moved, searches be made for information contained in nodes on the tree, computations made from data stored at nodes distributed across the tree, etc. Nodes would consist of a set of data (a small table perhaps). I´m trying to figure out what data structure to use so that some branches can concurrently be present at several locations in the tree all the while maximising performance/efficiency/simplicity for the aforementioned routine manipulations.
– Anskulainen
Nov 13 at 8:20
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I have a very big tree. Is it problematic if instead of keeping that big tree my program concurrently handles many smaller trees representing branches of that big tree?
Knowing I wouldn’t decide where the branches are cut from to make this the most efficiently but this would be imposed on me (so I’d end up dealing with many smaller trees of unequal size pointing to each other). The goal is to handle the capacity of the same branches (not copies of their contents nor links) to concurently exist at different locations in the tree.
algorithm data-structures tree branch
asked Nov 13 at 1:15
Anskulainen
155
I have a very big tree. Is it problematic if instead of keeping that big tree my program concurrently handles many smaller trees representing branches of that big tree?
Knowing I wouldn’t decide where the branches are cut from to make this the most efficiently but this would be imposed on me (so I’d end up dealing with many smaller trees of unequal size pointing to each other). The goal is to handle the capacity of the same branches (not copies of their contents nor links) to concurently exist at different locations in the tree.
algorithm data-structures tree branch
algorithm data-structures tree branch
asked Nov 13 at 1:15
Anskulainen
155
asked Nov 13 at 1:15
Anskulainen
155
asked Nov 13 at 1:15
Anskulainen
155
asked Nov 13 at 1:15
Anskulainen
155
asked Nov 13 at 1:15
Anskulainen
155
155
Are you thinking of a recursive divide and conquer algorithm? If so, then that is not at all problematic - quite the opposite! Otherwise, could you maybe add some code / pseudo code that demonstrates what you are trying to do?
– runcoderun
Nov 13 at 8:01
1
@runcoderun Branches would be iterated upon by a human user, nodes added or deleted, children re-ordered under their parent, entire branches moved, searches be made for information contained in nodes on the tree, computations made from data stored at nodes distributed across the tree, etc. Nodes would consist of a set of data (a small table perhaps). I´m trying to figure out what data structure to use so that some branches can concurrently be present at several locations in the tree all the while maximising performance/efficiency/simplicity for the aforementioned routine manipulations.
– Anskulainen
Nov 13 at 8:20
add a comment |
Are you thinking of a recursive divide and conquer algorithm? If so, then that is not at all problematic - quite the opposite! Otherwise, could you maybe add some code / pseudo code that demonstrates what you are trying to do?
– runcoderun
Nov 13 at 8:01
1
@runcoderun Branches would be iterated upon by a human user, nodes added or deleted, children re-ordered under their parent, entire branches moved, searches be made for information contained in nodes on the tree, computations made from data stored at nodes distributed across the tree, etc. Nodes would consist of a set of data (a small table perhaps). I´m trying to figure out what data structure to use so that some branches can concurrently be present at several locations in the tree all the while maximising performance/efficiency/simplicity for the aforementioned routine manipulations.
– Anskulainen
Nov 13 at 8:20
Are you thinking of a recursive divide and conquer algorithm? If so, then that is not at all problematic - quite the opposite! Otherwise, could you maybe add some code / pseudo code that demonstrates what you are trying to do?
– runcoderun
Nov 13 at 8:01
Are you thinking of a recursive divide and conquer algorithm? If so, then that is not at all problematic - quite the opposite! Otherwise, could you maybe add some code / pseudo code that demonstrates what you are trying to do?
– runcoderun
Nov 13 at 8:01
1
1
@runcoderun Branches would be iterated upon by a human user, nodes added or deleted, children re-ordered under their parent, entire branches moved, searches be made for information contained in nodes on the tree, computations made from data stored at nodes distributed across the tree, etc. Nodes would consist of a set of data (a small table perhaps). I´m trying to figure out what data structure to use so that some branches can concurrently be present at several locations in the tree all the while maximising performance/efficiency/simplicity for the aforementioned routine manipulations.
– Anskulainen
Nov 13 at 8:20
@runcoderun Branches would be iterated upon by a human user, nodes added or deleted, children re-ordered under their parent, entire branches moved, searches be made for information contained in nodes on the tree, computations made from data stored at nodes distributed across the tree, etc. Nodes would consist of a set of data (a small table perhaps). I´m trying to figure out what data structure to use so that some branches can concurrently be present at several locations in the tree all the while maximising performance/efficiency/simplicity for the aforementioned routine manipulations.
– Anskulainen
Nov 13 at 8:20
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53272365%2fhandling-smaller-trees-representing-branches-of-the-big-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Are you thinking of a recursive divide and conquer algorithm? If so, then that is not at all problematic - quite the opposite! Otherwise, could you maybe add some code / pseudo code that demonstrates what you are trying to do?
– runcoderun
Nov 13 at 8:01
1
@runcoderun Branches would be iterated upon by a human user, nodes added or deleted, children re-ordered under their parent, entire branches moved, searches be made for information contained in nodes on the tree, computations made from data stored at nodes distributed across the tree, etc. Nodes would consist of a set of data (a small table perhaps). I´m trying to figure out what data structure to use so that some branches can concurrently be present at several locations in the tree all the while maximising performance/efficiency/simplicity for the aforementioned routine manipulations.
– Anskulainen
Nov 13 at 8:20