20 lines
1.9 KiB
XML
20 lines
1.9 KiB
XML
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 900 416" width="900" height="416"><title>最小生成树：本章知识结构</title><defs><marker id="a" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0 0L10 5L0 10Z" fill="#416687"/></marker></defs><rect width="100%" height="100%" fill="white"/><g font-family="Microsoft YaHei,Arial,sans-serif" fill="#263c52" stroke-linecap="round">
|
|
<rect x="150" y="15" width="600" height="45" stroke="#67859e" fill="#e6edf5" stroke-width="1.5"/>
|
|
<text x="450" y="38" text-anchor="middle" dominant-baseline="central" font-size="25">最小生成树</text>
|
|
<path d="M35 62L35 391" fill="none" stroke="#416687" stroke-width="2"/>
|
|
<path d="M35 62L450 62" fill="none" stroke="#416687" stroke-width="2"/>
|
|
<path d="M35 107L65 107" fill="none" stroke="#416687" stroke-width="2"/>
|
|
<rect x="65" y="90" width="805" height="35" stroke="#67859e" fill="#eef3f8" stroke-width="1.5"/>
|
|
<text x="80" y="114" font-size="21" font-weight="bold">最小生成树及其应用</text>
|
|
<text x="95" y="157" font-size="18">例 11-1：最小生成树</text>
|
|
<text x="440" y="157" font-size="18">Prim 算法；Kruskal 算法</text>
|
|
<text x="95" y="211" font-size="18">例 11-2：买礼物</text>
|
|
<text x="440" y="211" font-size="18">最小生成树的应用</text>
|
|
<text x="95" y="265" font-size="18">例 11-3：构造树</text>
|
|
<text x="440" y="265" font-size="18">最小生成树的应用</text>
|
|
<path d="M35 324L65 324" fill="none" stroke="#416687" stroke-width="2"/>
|
|
<rect x="65" y="307" width="805" height="35" stroke="#67859e" fill="#eef3f8" stroke-width="1.5"/>
|
|
<text x="80" y="331" font-size="21" font-weight="bold">次小生成树（选读）</text>
|
|
<text x="95" y="374" font-size="18">例 11-4：严格次小生成树</text>
|
|
<text x="440" y="374" font-size="18">严格次小生成树的求解方法</text>
|
|
</g></svg> |