Graphviz Decision tree display separately for the same elements
I have the codes here,
import graphviz as gv
d=gv.Digraph()
d.edge('a','b')
d.edge('a','c')
d.edge('b','c')
the output is as pic:
How can I get a graph like this:
python-3.x graphviz
add a comment |
I have the codes here,
import graphviz as gv
d=gv.Digraph()
d.edge('a','b')
d.edge('a','c')
d.edge('b','c')
the output is as pic:
How can I get a graph like this:
python-3.x graphviz
add a comment |
I have the codes here,
import graphviz as gv
d=gv.Digraph()
d.edge('a','b')
d.edge('a','c')
d.edge('b','c')
the output is as pic:
How can I get a graph like this:
python-3.x graphviz
I have the codes here,
import graphviz as gv
d=gv.Digraph()
d.edge('a','b')
d.edge('a','c')
d.edge('b','c')
the output is as pic:
How can I get a graph like this:
python-3.x graphviz
python-3.x graphviz
edited Jan 2 at 9:04
albert
2,96931123
2,96931123
asked Jan 2 at 3:47
S.GuS.Gu
8410
8410
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Not using Python, I only have a pure graphviz
answer but you should be able to translate that easily into Python.
You need to do two things:
- Create four nodes, not three, and give them the label you want
- Put the nodes you want to have on the same level into a
rank = same
instruction (not strictly necessary in the example context but may be needed for more complex graphs)
Here we go:
digraph so
{
n_1[ label = "a" ];
n_2[ label = "b" ];
n_3[ label = "c" ];
n_4[ label = "c" ];
{ rank = same; n_2 n_3 }
n_1 -> { n_2 n_3 };
n_2 -> n_4;
}
which gives you
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
add a comment |
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%2f54000991%2fgraphviz-decision-tree-display-separately-for-the-same-elements%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Not using Python, I only have a pure graphviz
answer but you should be able to translate that easily into Python.
You need to do two things:
- Create four nodes, not three, and give them the label you want
- Put the nodes you want to have on the same level into a
rank = same
instruction (not strictly necessary in the example context but may be needed for more complex graphs)
Here we go:
digraph so
{
n_1[ label = "a" ];
n_2[ label = "b" ];
n_3[ label = "c" ];
n_4[ label = "c" ];
{ rank = same; n_2 n_3 }
n_1 -> { n_2 n_3 };
n_2 -> n_4;
}
which gives you
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
add a comment |
Not using Python, I only have a pure graphviz
answer but you should be able to translate that easily into Python.
You need to do two things:
- Create four nodes, not three, and give them the label you want
- Put the nodes you want to have on the same level into a
rank = same
instruction (not strictly necessary in the example context but may be needed for more complex graphs)
Here we go:
digraph so
{
n_1[ label = "a" ];
n_2[ label = "b" ];
n_3[ label = "c" ];
n_4[ label = "c" ];
{ rank = same; n_2 n_3 }
n_1 -> { n_2 n_3 };
n_2 -> n_4;
}
which gives you
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
add a comment |
Not using Python, I only have a pure graphviz
answer but you should be able to translate that easily into Python.
You need to do two things:
- Create four nodes, not three, and give them the label you want
- Put the nodes you want to have on the same level into a
rank = same
instruction (not strictly necessary in the example context but may be needed for more complex graphs)
Here we go:
digraph so
{
n_1[ label = "a" ];
n_2[ label = "b" ];
n_3[ label = "c" ];
n_4[ label = "c" ];
{ rank = same; n_2 n_3 }
n_1 -> { n_2 n_3 };
n_2 -> n_4;
}
which gives you
Not using Python, I only have a pure graphviz
answer but you should be able to translate that easily into Python.
You need to do two things:
- Create four nodes, not three, and give them the label you want
- Put the nodes you want to have on the same level into a
rank = same
instruction (not strictly necessary in the example context but may be needed for more complex graphs)
Here we go:
digraph so
{
n_1[ label = "a" ];
n_2[ label = "b" ];
n_3[ label = "c" ];
n_4[ label = "c" ];
{ rank = same; n_2 n_3 }
n_1 -> { n_2 n_3 };
n_2 -> n_4;
}
which gives you
edited Jan 2 at 11:53
answered Jan 2 at 9:06
vaettchenvaettchen
5,2601332
5,2601332
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
add a comment |
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
When necessary you can easily test something at webgraphviz.com
– albert
Jan 2 at 9:10
add a comment |
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.
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%2f54000991%2fgraphviz-decision-tree-display-separately-for-the-same-elements%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