mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-12 11:37:18 +08:00
Documentation for 0953376d31
This commit is contained in:
@@ -1,5 +1,7 @@
|
||||
<map id="search/median_search2.cpp" name="search/median_search2.cpp">
|
||||
<area shape="rect" id="node1" title="Given a linked list L[0,....,n] of n numbers, find the middle node." alt="" coords="5,5,190,31"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="20,79,84,105"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="109,79,180,105"/>
|
||||
<area shape="rect" id="Node000001" title="Given a linked list L[0,....,n] of n numbers, find the middle node." alt="" coords="5,5,190,31"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="20,79,84,105"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,33,70,68,65,65,88,30"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="109,79,180,105"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="107,30,130,65,126,68,103,33"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
3b2aa67abc4a7a6dbc0ec06089a024a2
|
||||
3230400d0edbcdd4c5aba35d78a6cef3
|
||||
@@ -6,46 +6,77 @@
|
||||
<!-- Title: search/median_search2.cpp Pages: 1 -->
|
||||
<svg width="146pt" height="83pt"
|
||||
viewBox="0.00 0.00 146.25 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.5)">
|
||||
<title>search/median_search2.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Given a linked list L[0,....,n] of n numbers, find the middle node.">
|
||||
<g id="a_Node000001"><a xlink:title="Given a linked list L[0,....,n] of n numbers, find the middle node.">
|
||||
<polygon fill="#999999" stroke="#666666" points="138.25,-74.5 0,-74.5 0,-55.25 138.25,-55.25 138.25,-74.5"/>
|
||||
<text text-anchor="middle" x="69.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">search/median_search2.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="59.25,-19.25 11,-19.25 11,0 59.25,0 59.25,-19.25"/>
|
||||
<text text-anchor="middle" x="35.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M63.51,-55.08C58.96,-47.96 52.4,-37.68 46.73,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="49.19,-27.15 40.86,-20.61 43.29,-30.92 49.19,-27.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="130.88,-19.25 77.38,-19.25 77.38,0 130.88,0 130.88,-19.25"/>
|
||||
<text text-anchor="middle" x="104.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M74.9,-55.08C79.59,-47.96 86.34,-37.68 92.18,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="95.65,-30.89 98.22,-20.61 89.8,-27.04 95.65,-30.89"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.2 KiB After Width: | Height: | Size: 3.2 KiB |
57
d9/d73/median__search2_8cpp__incl_org.svg
Normal file
57
d9/d73/median__search2_8cpp__incl_org.svg
Normal file
@@ -0,0 +1,57 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: search/median_search2.cpp Pages: 1 -->
|
||||
<svg width="146pt" height="83pt"
|
||||
viewBox="0.00 0.00 146.25 82.50" 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 78.5)">
|
||||
<title>search/median_search2.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Given a linked list L[0,....,n] of n numbers, find the middle node.">
|
||||
<polygon fill="#999999" stroke="#666666" points="138.25,-74.5 0,-74.5 0,-55.25 138.25,-55.25 138.25,-74.5"/>
|
||||
<text text-anchor="middle" x="69.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">search/median_search2.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="59.25,-19.25 11,-19.25 11,0 59.25,0 59.25,-19.25"/>
|
||||
<text text-anchor="middle" x="35.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M63.51,-55.08C58.96,-47.96 52.4,-37.68 46.73,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="49.19,-27.15 40.86,-20.61 43.29,-30.92 49.19,-27.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="130.88,-19.25 77.38,-19.25 77.38,0 130.88,0 130.88,-19.25"/>
|
||||
<text text-anchor="middle" x="104.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M74.9,-55.08C79.59,-47.96 86.34,-37.68 92.18,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="95.65,-30.89 98.22,-20.61 89.8,-27.04 95.65,-30.89"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.4 KiB |
Reference in New Issue
Block a user