How can I create a d3 bidirectional node tree using one dataset?
I'm trying to render a d3 tree graph such that it the dataset expands out from both sides of the central node. I've been looking at examples like this and want to keep the drag and drop functionality. The closest example that I can find is:
Tree with children towards multiple side in d3.js (similar to family tree)
So far I have attempted to try and toggle the d.y value to negative by subtracting it from the viewerWidth variable in the update(source) function. This just reverses the direction of the d3 tree chart from right to left only.
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
If I apply this to certain entries in the nodes array, then the tree does divide but the x value spacing is out:
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d,i) {
if(i < nodes.length / 2) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
}else {
d.y = (d.depth * (maxLabelLength * 10));
}
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
Another solution is to render the tree in one direction, and then try manipulating the positions of the nodes afterwards, but this isn't ideal.
How can I create a bidirectional node tree using the one dataset?
javascript d3.js
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
add a comment |
I'm trying to render a d3 tree graph such that it the dataset expands out from both sides of the central node. I've been looking at examples like this and want to keep the drag and drop functionality. The closest example that I can find is:
Tree with children towards multiple side in d3.js (similar to family tree)
So far I have attempted to try and toggle the d.y value to negative by subtracting it from the viewerWidth variable in the update(source) function. This just reverses the direction of the d3 tree chart from right to left only.
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
If I apply this to certain entries in the nodes array, then the tree does divide but the x value spacing is out:
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d,i) {
if(i < nodes.length / 2) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
}else {
d.y = (d.depth * (maxLabelLength * 10));
}
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
Another solution is to render the tree in one direction, and then try manipulating the positions of the nodes afterwards, but this isn't ideal.
How can I create a bidirectional node tree using the one dataset?
javascript d3.js
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
add a comment |
I'm trying to render a d3 tree graph such that it the dataset expands out from both sides of the central node. I've been looking at examples like this and want to keep the drag and drop functionality. The closest example that I can find is:
Tree with children towards multiple side in d3.js (similar to family tree)
So far I have attempted to try and toggle the d.y value to negative by subtracting it from the viewerWidth variable in the update(source) function. This just reverses the direction of the d3 tree chart from right to left only.
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
If I apply this to certain entries in the nodes array, then the tree does divide but the x value spacing is out:
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d,i) {
if(i < nodes.length / 2) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
}else {
d.y = (d.depth * (maxLabelLength * 10));
}
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
Another solution is to render the tree in one direction, and then try manipulating the positions of the nodes afterwards, but this isn't ideal.
How can I create a bidirectional node tree using the one dataset?
javascript d3.js
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
I'm trying to render a d3 tree graph such that it the dataset expands out from both sides of the central node. I've been looking at examples like this and want to keep the drag and drop functionality. The closest example that I can find is:
Tree with children towards multiple side in d3.js (similar to family tree)
So far I have attempted to try and toggle the d.y value to negative by subtracting it from the viewerWidth variable in the update(source) function. This just reverses the direction of the d3 tree chart from right to left only.
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
If I apply this to certain entries in the nodes array, then the tree does divide but the x value spacing is out:
function update(source) {
//Other code
// Set widths between levels based on maxLabelLength.
nodes.forEach(function(d,i) {
if(i < nodes.length / 2) {
d.y = viewerWidth - (d.depth * (maxLabelLength * 10)); //maxLabelLength * 10px
}else {
d.y = (d.depth * (maxLabelLength * 10));
}
// alternatively to keep a fixed scale one can set a fixed depth per level
// Normalize for fixed-depth by commenting out below line
// d.y = (d.depth * 500); //500px per level.
});
//Other code
}
Another solution is to render the tree in one direction, and then try manipulating the positions of the nodes afterwards, but this isn't ideal.
How can I create a bidirectional node tree using the one dataset?
javascript d3.js
javascript d3.js
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
asked Nov 15 '18 at 1:37
LeDocLeDoc
5981517
5981517
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f53311245%2fhow-can-i-create-a-d3-bidirectional-node-tree-using-one-dataset%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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%2f53311245%2fhow-can-i-create-a-d3-bidirectional-node-tree-using-one-dataset%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
