mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-30 16:51:57 +08:00
83 lines
3.1 KiB
XML
83 lines
3.1 KiB
XML
<?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/linear_search.cpp Pages: 1 -->
|
|
<svg width="133pt" height="83pt"
|
|
viewBox="0.00 0.00 132.75 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/linear_search.cpp</title>
|
|
<!-- Node1 -->
|
|
<g id="Node000001" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_Node000001"><a xlink:title="Linear search algorithm">
|
|
<polygon fill="#999999" stroke="#666666" points="124.75,-74.5 0,-74.5 0,-55.25 124.75,-55.25 124.75,-74.5"/>
|
|
<text text-anchor="middle" x="62.38" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">search/linear_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="52.5,-19.25 4.25,-19.25 4.25,0 52.5,0 52.5,-19.25"/>
|
|
<text text-anchor="middle" x="28.38" 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="M56.76,-55.08C52.21,-47.96 45.65,-37.68 39.98,-28.8"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="42.44,-27.15 34.11,-20.61 36.54,-30.92 42.44,-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="124.12,-19.25 70.62,-19.25 70.62,0 124.12,0 124.12,-19.25"/>
|
|
<text text-anchor="middle" x="97.38" 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="M68.15,-55.08C72.84,-47.96 79.59,-37.68 85.43,-28.8"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.9,-30.89 91.47,-20.61 83.05,-27.04 88.9,-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>
|