mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-16 11:32:44 +08:00
Documentation for 0953376d31
This commit is contained in:
@@ -1,5 +1,7 @@
|
||||
<map id="search/hash_search.cpp" name="search/hash_search.cpp">
|
||||
<area shape="rect" id="node1" title="Hash Search Algorithm - Best Time Complexity Ω(1)" alt="" coords="5,5,169,31"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="13,79,73,105"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="97,79,168,105"/>
|
||||
<area shape="rect" id="Node000001" title="Hash Search Algorithm - Best Time Complexity Ω(1)" alt="" coords="5,5,169,31"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="13,79,73,105"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="82,33,60,68,56,65,77,30"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="97,79,168,105"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="97,30,119,65,115,68,92,33"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
626793d3a7dcae1b9c7b9ee37b2af7b9
|
||||
45f64ce3c6a8aa099bd1d87e8e7b52d4
|
||||
@@ -6,46 +6,77 @@
|
||||
<!-- Title: search/hash_search.cpp Pages: 1 -->
|
||||
<svg width="131pt" height="83pt"
|
||||
viewBox="0.00 0.00 130.50 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/hash_search.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Hash Search Algorithm - Best Time Complexity Ω(1)">
|
||||
<g id="a_Node000001"><a xlink:title="Hash Search Algorithm - Best Time Complexity Ω(1)">
|
||||
<polygon fill="#999999" stroke="#666666" points="122.5,-74.5 0,-74.5 0,-55.25 122.5,-55.25 122.5,-74.5"/>
|
||||
<text text-anchor="middle" x="61.25" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">search/hash_search.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="50.5,-19.25 6,-19.25 6,0 50.5,0 50.5,-19.25"/>
|
||||
<text text-anchor="middle" x="28.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</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="M55.8,-55.08C51.38,-47.96 45.01,-37.68 39.51,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="42.06,-27.27 33.82,-20.61 36.11,-30.95 42.06,-27.27"/>
|
||||
</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="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
|
||||
<text text-anchor="middle" x="95.25" 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="M66.86,-55.08C71.41,-47.96 77.98,-37.68 83.65,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.08,-30.92 89.51,-20.61 81.18,-27.15 87.08,-30.92"/>
|
||||
</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.1 KiB After Width: | Height: | Size: 3.1 KiB |
57
d3/d30/hash__search_8cpp__incl_org.svg
Normal file
57
d3/d30/hash__search_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/hash_search.cpp Pages: 1 -->
|
||||
<svg width="131pt" height="83pt"
|
||||
viewBox="0.00 0.00 130.50 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/hash_search.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Hash Search Algorithm - Best Time Complexity Ω(1)">
|
||||
<polygon fill="#999999" stroke="#666666" points="122.5,-74.5 0,-74.5 0,-55.25 122.5,-55.25 122.5,-74.5"/>
|
||||
<text text-anchor="middle" x="61.25" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">search/hash_search.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="50.5,-19.25 6,-19.25 6,0 50.5,0 50.5,-19.25"/>
|
||||
<text text-anchor="middle" x="28.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</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="M55.8,-55.08C51.38,-47.96 45.01,-37.68 39.51,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="42.06,-27.27 33.82,-20.61 36.11,-30.95 42.06,-27.27"/>
|
||||
</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="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
|
||||
<text text-anchor="middle" x="95.25" 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="M66.86,-55.08C71.41,-47.96 77.98,-37.68 83.65,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.08,-30.92 89.51,-20.61 81.18,-27.15 87.08,-30.92"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.3 KiB |
Reference in New Issue
Block a user