LaTeX Tree Diagram
0
I'm trying to recreate the diagram on this website: http://www.njohnston.ca/2013/04/the-minimal-superpermutation-problem/
and am finding difficulty with joining all the nodes in the third row to a singular node. This is what I have got so far:
begin{center}
begin{tikzpicture}[sibling distance=5em,
every node/.style = {shape=circle,
draw, align=center,}]]
node {$123121321$}
child { node {123}
child {node {1234123} } }
child { node {231}
child {node {2314231} } }
child {node {312}
child {node {3124312} } }
child {node {213}
child {node {2134213} } }
child {node {132}
child {node {1324132} } }
child {node {321}
child {node {3214321} } };
end{tikzpicture}
end{center}
nodes graphs tikz-node node-connections
edited 7 hours ago
Phelype Oleinik
24.9k54690
asked 8 hours ago
Simran JohalSimran Johal
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
0
I'm trying to recreate the diagram on this website: http://www.njohnston.ca/2013/04/the-minimal-superpermutation-problem/
and am finding difficulty with joining all the nodes in the third row to a singular node. This is what I have got so far:
begin{center}
begin{tikzpicture}[sibling distance=5em,
every node/.style = {shape=circle,
draw, align=center,}]]
node {$123121321$}
child { node {123}
child {node {1234123} } }
child { node {231}
child {node {2314231} } }
child {node {312}
child {node {3124312} } }
child {node {213}
child {node {2134213} } }
child {node {132}
child {node {1324132} } }
child {node {321}
child {node {3214321} } };
end{tikzpicture}
end{center}
nodes graphs tikz-node node-connections
edited 7 hours ago
Phelype Oleinik
24.9k54690
asked 8 hours ago
Simran JohalSimran Johal
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
Welcome to TeX.se. Please don't post code fragments, but instead put your fragment into a complete compilable document.
– Alan Munn
7 hours ago
add a comment |
0
0
0
I'm trying to recreate the diagram on this website: http://www.njohnston.ca/2013/04/the-minimal-superpermutation-problem/
and am finding difficulty with joining all the nodes in the third row to a singular node. This is what I have got so far:
begin{center}
begin{tikzpicture}[sibling distance=5em,
every node/.style = {shape=circle,
draw, align=center,}]]
node {$123121321$}
child { node {123}
child {node {1234123} } }
child { node {231}
child {node {2314231} } }
child {node {312}
child {node {3124312} } }
child {node {213}
child {node {2134213} } }
child {node {132}
child {node {1324132} } }
child {node {321}
child {node {3214321} } };
end{tikzpicture}
end{center}
nodes graphs tikz-node node-connections
edited 7 hours ago
Phelype Oleinik
24.9k54690
asked 8 hours ago
Simran JohalSimran Johal
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
I'm trying to recreate the diagram on this website: http://www.njohnston.ca/2013/04/the-minimal-superpermutation-problem/
and am finding difficulty with joining all the nodes in the third row to a singular node. This is what I have got so far:
begin{center}
begin{tikzpicture}[sibling distance=5em,
every node/.style = {shape=circle,
draw, align=center,}]]
node {$123121321$}
child { node {123}
child {node {1234123} } }
child { node {231}
child {node {2314231} } }
child {node {312}
child {node {3124312} } }
child {node {213}
child {node {2134213} } }
child {node {132}
child {node {1324132} } }
child {node {321}
child {node {3214321} } };
end{tikzpicture}
end{center}
nodes graphs tikz-node node-connections
nodes graphs tikz-node node-connections
edited 7 hours ago
Phelype Oleinik
24.9k54690
asked 8 hours ago
Simran JohalSimran Johal
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 7 hours ago
Phelype Oleinik
24.9k54690
asked 8 hours ago
Simran JohalSimran Johal
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 7 hours ago
Phelype Oleinik
24.9k54690
edited 7 hours ago
Phelype Oleinik
24.9k54690
edited 7 hours ago
Phelype Oleinik
24.9k54690
24.9k54690
asked 8 hours ago
Simran JohalSimran Johal
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 hours ago
Simran JohalSimran Johal
1
asked 8 hours ago
Simran JohalSimran Johal
1
1
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Simran Johal is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
Welcome to TeX.se. Please don't post code fragments, but instead put your fragment into a complete compilable document.
– Alan Munn
7 hours ago
add a comment |
1
Welcome to TeX.se. Please don't post code fragments, but instead put your fragment into a complete compilable document.
– Alan Munn
7 hours ago
1
1
Welcome to TeX.se. Please don't post code fragments, but instead put your fragment into a complete compilable document.
– Alan Munn
7 hours ago
Welcome to TeX.se. Please don't post code fragments, but instead put your fragment into a complete compilable document.
– Alan Munn
7 hours ago
add a comment |
1 Answer
1
active
oldest
votes
1
I'd use forest. The foreach loop at the end can be used for your original code, too (after changing the node names).
documentclass[border=3.14mm]{standalone}
usepackage[edges]{forest}
usetikzlibrary{shapes.geometric}
begin{document}
begin{forest}
for tree={draw, ellipse,edge={-latex}}
[123121,alias=top
[123
[1234123,alias=n-1]
]
[231
[2314231,alias=n-2]
]
[312
[3124312,alias=n-3]
]
[213
[2134213,alias=n-4]
]
[132
[1324132,alias=n-5]
]
[321
[3214321,alias=n-6]
]
]
node[ellipse,draw] (Pft) at ([yshift=-pi*1.1cm]top) {1234dots};
foreach X in {1,...,6}
{draw[-latex] (n-X) -- (Pft);}
end{forest}
end{document}
answered 7 hours ago
marmotmarmot
116k5147277
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "85"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
});
}
});
Simran Johal is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
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%2ftex.stackexchange.com%2fquestions%2f483856%2flatex-tree-diagram%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
1
I'd use forest. The foreach loop at the end can be used for your original code, too (after changing the node names).
documentclass[border=3.14mm]{standalone}
usepackage[edges]{forest}
usetikzlibrary{shapes.geometric}
begin{document}
begin{forest}
for tree={draw, ellipse,edge={-latex}}
[123121,alias=top
[123
[1234123,alias=n-1]
]
[231
[2314231,alias=n-2]
]
[312
[3124312,alias=n-3]
]
[213
[2134213,alias=n-4]
]
[132
[1324132,alias=n-5]
]
[321
[3214321,alias=n-6]
]
]
node[ellipse,draw] (Pft) at ([yshift=-pi*1.1cm]top) {1234dots};
foreach X in {1,...,6}
{draw[-latex] (n-X) -- (Pft);}
end{forest}
end{document}
answered 7 hours ago
marmotmarmot
116k5147277
add a comment |
1
I'd use forest. The foreach loop at the end can be used for your original code, too (after changing the node names).
documentclass[border=3.14mm]{standalone}
usepackage[edges]{forest}
usetikzlibrary{shapes.geometric}
begin{document}
begin{forest}
for tree={draw, ellipse,edge={-latex}}
[123121,alias=top
[123
[1234123,alias=n-1]
]
[231
[2314231,alias=n-2]
]
[312
[3124312,alias=n-3]
]
[213
[2134213,alias=n-4]
]
[132
[1324132,alias=n-5]
]
[321
[3214321,alias=n-6]
]
]
node[ellipse,draw] (Pft) at ([yshift=-pi*1.1cm]top) {1234dots};
foreach X in {1,...,6}
{draw[-latex] (n-X) -- (Pft);}
end{forest}
end{document}
answered 7 hours ago
marmotmarmot
116k5147277
add a comment |
1
1
1
I'd use forest. The foreach loop at the end can be used for your original code, too (after changing the node names).
documentclass[border=3.14mm]{standalone}
usepackage[edges]{forest}
usetikzlibrary{shapes.geometric}
begin{document}
begin{forest}
for tree={draw, ellipse,edge={-latex}}
[123121,alias=top
[123
[1234123,alias=n-1]
]
[231
[2314231,alias=n-2]
]
[312
[3124312,alias=n-3]
]
[213
[2134213,alias=n-4]
]
[132
[1324132,alias=n-5]
]
[321
[3214321,alias=n-6]
]
]
node[ellipse,draw] (Pft) at ([yshift=-pi*1.1cm]top) {1234dots};
foreach X in {1,...,6}
{draw[-latex] (n-X) -- (Pft);}
end{forest}
end{document}
answered 7 hours ago
marmotmarmot
116k5147277
I'd use forest. The foreach loop at the end can be used for your original code, too (after changing the node names).
documentclass[border=3.14mm]{standalone}
usepackage[edges]{forest}
usetikzlibrary{shapes.geometric}
begin{document}
begin{forest}
for tree={draw, ellipse,edge={-latex}}
[123121,alias=top
[123
[1234123,alias=n-1]
]
[231
[2314231,alias=n-2]
]
[312
[3124312,alias=n-3]
]
[213
[2134213,alias=n-4]
]
[132
[1324132,alias=n-5]
]
[321
[3214321,alias=n-6]
]
]
node[ellipse,draw] (Pft) at ([yshift=-pi*1.1cm]top) {1234dots};
foreach X in {1,...,6}
{draw[-latex] (n-X) -- (Pft);}
end{forest}
end{document}
answered 7 hours ago
marmotmarmot
116k5147277
answered 7 hours ago
marmotmarmot
116k5147277
answered 7 hours ago
marmotmarmot
116k5147277
answered 7 hours ago
marmotmarmot
116k5147277
116k5147277
add a comment |
add a comment |
Simran Johal is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Simran Johal is a new contributor. Be nice, and check out our Code of Conduct.
Simran Johal is a new contributor. Be nice, and check out our Code of Conduct.
Simran Johal is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to TeX - LaTeX Stack Exchange!
- 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.
draft saved
draft discarded
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%2ftex.stackexchange.com%2fquestions%2f483856%2flatex-tree-diagram%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
1
Welcome to TeX.se. Please don't post code fragments, but instead put your fragment into a complete compilable document.
– Alan Munn
7 hours ago