lessons/课程/插图/06-最小与最大生成树/00-KRT-02-LCA就是相遇.svg

<svg xmlns="http://www.w3.org/2000/svg" width="900" height="330" viewBox="0 0 900 330">
  <style>.t{font:16px sans-serif;fill:#1f2937}.s{font:13px sans-serif;fill:#475569}.n{fill:#fff;stroke:#2563eb;stroke-width:3}.event{fill:#fff7ed;stroke:#ea580c;stroke-width:3}.e{stroke:#94a3b8;stroke-width:3}.p1{stroke:#2563eb;stroke-width:6}.p2{stroke:#dc2626;stroke-width:6}</style>
  <rect width="900" height="330" fill="white"/><text x="35" y="34" class="t" font-weight="bold">从叶 2、4 向上找：第一次会合的事件卡 8@5 就是首次连通阈值</text>
  <g class="e"><line x1="450" y1="70" x2="330" y2="150"/><line x1="450" y1="70" x2="620" y2="235"/><line x1="330" y1="150" x2="220" y2="235"/><line x1="330" y1="150" x2="440" y2="235"/><line x1="220" y1="235" x2="145" y2="295"/><line x1="220" y1="235" x2="285" y2="295"/><line x1="440" y1="235" x2="390" y2="295"/><line x1="440" y1="235" x2="510" y2="295"/></g>
  <g class="p1"><line x1="285" y1="295" x2="220" y2="235"/><line x1="220" y1="235" x2="330" y2="150"/></g><g class="p2"><line x1="510" y1="295" x2="440" y2="235"/><line x1="440" y1="235" x2="330" y2="150"/></g>
  <g class="event"><rect x="420" y="48" width="60" height="44" rx="7"/><rect x="300" y="128" width="60" height="44" rx="7"/><rect x="190" y="213" width="60" height="44" rx="7"/><rect x="410" y="213" width="60" height="44" rx="7"/></g>
  <g class="n"><circle cx="145" cy="295" r="18"/><circle cx="285" cy="295" r="18"/><circle cx="390" cy="295" r="18"/><circle cx="510" cy="295" r="18"/><circle cx="620" cy="235" r="18"/></g>
  <g class="t" text-anchor="middle"><text x="450" y="76">9@6</text><text x="330" y="156">8@5</text><text x="220" y="241">6@2</text><text x="440" y="241">7@3</text><text x="145" y="301">1</text><text x="285" y="301">2</text><text x="390" y="301">3</text><text x="510" y="301">4</text><text x="620" y="241">5</text></g>
  <text x="88" y="200" class="s" fill="#2563eb">2 的祖先链</text><text x="530" y="190" class="s" fill="#dc2626">4 的祖先链</text>
</svg>