mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-27 08:51:41 +08:00
Documentation for 79fb528dad
This commit is contained in:
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('dc/d61/classgraph_1_1_graph.html','../
|
||||
<p>This is the complete list of members for <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">Graph</a>(size_t N, const std::vector< std::pair< int, int > > &undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#afe3c12683248e50a7a1688b40156a842">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>() const</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@@ -1,8 +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"/>
|
||||
<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="144,5,297,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="95,95,167,121"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="192,95,249,121"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="274,95,327,121"/>
|
||||
<area shape="rect" id="node6" title=" " alt="" coords="351,95,410,121"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
feebcb6a27d1da6fc5957bddbf9dee90
|
||||
da9501f775cb6385de39dd889873c654
|
||||
@@ -4,18 +4,18 @@
|
||||
<!-- 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">
|
||||
<svg width="312pt" height="95pt"
|
||||
viewBox="0.00 0.00 311.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"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 307.5,-91 307.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>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="104,-56.5 104,-86.5 219,-86.5 219,-56.5 104,-56.5"/>
|
||||
<text text-anchor="start" x="112" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph/lowest_common</text>
|
||||
<text text-anchor="middle" x="161.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_ancestor.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -23,76 +23,76 @@
|
||||
<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>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->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"/>
|
||||
<path fill="none" stroke="midnightblue" d="M129.03,-56.4C106.15,-46.46 75.77,-33.26 53.66,-23.66"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="55,-20.43 44.43,-19.66 52.21,-26.85 55,-20.43"/>
|
||||
</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>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
|
||||
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->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"/>
|
||||
<path fill="none" stroke="midnightblue" d="M145.62,-56.4C135.48,-47.4 122.34,-35.72 111.91,-26.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="114.05,-23.68 104.25,-19.66 109.4,-28.92 114.05,-23.68"/>
|
||||
</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>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="140,-0.5 140,-19.5 183,-19.5 183,-0.5 140,-0.5"/>
|
||||
<text text-anchor="middle" x="161.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->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"/>
|
||||
<path fill="none" stroke="midnightblue" d="M161.5,-56.4C161.5,-48.47 161.5,-38.46 161.5,-29.86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="165,-29.66 161.5,-19.66 158,-29.66 165,-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>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="201.5,-0.5 201.5,-19.5 241.5,-19.5 241.5,-0.5 201.5,-0.5"/>
|
||||
<text text-anchor="middle" x="221.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">utility</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->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"/>
|
||||
<path fill="none" stroke="midnightblue" d="M175.72,-56.4C184.71,-47.49 196.34,-35.95 205.63,-26.74"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="208.13,-29.18 212.77,-19.66 203.2,-24.21 208.13,-29.18"/>
|
||||
</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>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="259.5,-0.5 259.5,-19.5 303.5,-19.5 303.5,-0.5 259.5,-0.5"/>
|
||||
<text text-anchor="middle" x="281.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->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"/>
|
||||
<path fill="none" stroke="midnightblue" d="M189.94,-56.4C209.62,-46.64 235.64,-33.74 254.91,-24.18"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="256.63,-27.24 264.04,-19.66 253.52,-20.96 256.63,-27.24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 4.3 KiB After Width: | Height: | Size: 4.3 KiB |
Reference in New Issue
Block a user