backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 03:28:29 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for def8f4937e

Browse Source
This commit is contained in:
github-actions
2020-08-14 16:37:40 +00:00
parent 6789297597
commit ee28b3b78c
375 changed files with 8212 additions and 3991 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
db/d8e/lowest__common__ancestor_8cpp__incl.map Normal file
View File

@@ -0,0 +1,8 @@
<map id="graph/lowest_common_ancestor.cpp" name="graph/lowest_common_ancestor.cpp">
<area shape="rect" id="node1" title="Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary l..." alt="" coords="131,5,285,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,95,155,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="179,95,237,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="262,95,319,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="343,95,409,121"/>
</map>

1
db/d8e/lowest__common__ancestor_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
feebcb6a27d1da6fc5957bddbf9dee90

98
db/d8e/lowest__common__ancestor_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,98 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: graph/lowest_common_ancestor.cpp Pages: 1 -->
<svg width="311pt" height="95pt"
viewBox="0.00 0.00 310.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>graph/lowest_common_ancestor.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 306.5,-91 306.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary l...">
<polygon fill="#bfbfbf" stroke="black" points="94.5,-56.5 94.5,-86.5 209.5,-86.5 209.5,-56.5 94.5,-56.5"/>
<text text-anchor="start" x="102.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph/lowest_common</text>
<text text-anchor="middle" x="152" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_ancestor.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M122.38,-56.4C101.78,-46.59 74.52,-33.62 54.42,-24.05"/>
<polygon fill="midnightblue" stroke="midnightblue" points="55.72,-20.8 45.19,-19.66 52.71,-27.12 55.72,-20.8"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 112,-19.5 112,-0.5 72,-0.5"/>
<text text-anchor="middle" x="92" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">utility</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M137.78,-56.4C128.79,-47.49 117.16,-35.95 107.87,-26.74"/>
<polygon fill="midnightblue" stroke="midnightblue" points="110.3,-24.21 100.73,-19.66 105.37,-29.18 110.3,-24.21"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="130,-0.5 130,-19.5 174,-19.5 174,-0.5 130,-0.5"/>
<text text-anchor="middle" x="152" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M152,-56.4C152,-48.47 152,-38.46 152,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.5,-29.66 152,-19.66 148.5,-29.66 155.5,-29.66"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="192.5,-0.5 192.5,-19.5 235.5,-19.5 235.5,-0.5 192.5,-0.5"/>
<text text-anchor="middle" x="214" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M166.69,-56.4C175.98,-47.49 188,-35.95 197.6,-26.74"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.19,-29.11 204.98,-19.66 195.34,-24.06 200.19,-29.11"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="253.5,-0.5 253.5,-19.5 302.5,-19.5 302.5,-0.5 253.5,-0.5"/>
<text text-anchor="middle" x="278" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M181.86,-56.4C202.62,-46.59 230.1,-33.62 250.36,-24.05"/>
<polygon fill="midnightblue" stroke="midnightblue" points="252.12,-27.09 259.67,-19.66 249.13,-20.76 252.12,-27.09"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.3 KiB