LaTeX 树形图

Question

我正在尝试在此网站上重新创建该图表：http://www.njohnston.ca/2013/04/the-minimal-superpermutation-problem/ 我发现将第三行的所有节点合并到单个节点很困难。这是我目前得到的结果：

\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} 

Answer 1

我会用forest。\foreach最后的循环也可以用于您的原始代码（更改节点名称后）。

\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) {1234\dots};
\foreach \X in {1,...,6}
{\draw[-latex] (n-\X) -- (Pft);}
\end{forest}
\end{document}