mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-13 11:39:44 +08:00
Documentation for f1eddf4d65
This commit is contained in:
@@ -1,11 +1,11 @@
|
||||
<?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 12.2.1 (20241206.2353)
|
||||
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
|
||||
-->
|
||||
<!-- Title: data_structures/segment_tree.cpp Pages: 1 -->
|
||||
<svg width="262pt" height="94pt"
|
||||
viewBox="0.00 0.00 261.88 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
viewBox="0.00 0.00 262.00 94.00" 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">
|
||||
|
||||
@@ -24,8 +24,8 @@
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A data structure to quickly do operations on ranges: the Segment Tree algorithm implementation.">
|
||||
<polygon fill="#999999" stroke="#666666" points="187.75,-85.75 63.75,-85.75 63.75,-55.25 187.75,-55.25 187.75,-85.75"/>
|
||||
<text text-anchor="start" x="71.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/segment</text>
|
||||
<text text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_tree.cpp</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="71.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/segment</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_tree.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -34,7 +34,7 @@
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -52,7 +52,7 @@
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="114.25,-19.25 71.25,-19.25 71.25,0 114.25,0 114.25,-19.25"/>
|
||||
<text text-anchor="middle" x="92.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="92.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -70,7 +70,7 @@
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="187.62,-19.25 131.88,-19.25 131.88,0 187.62,0 187.62,-19.25"/>
|
||||
<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -88,7 +88,7 @@
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="253.88,-19.25 205.62,-19.25 205.62,0 253.88,0 253.88,-19.25"/>
|
||||
<text text-anchor="middle" x="229.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="229.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 4.8 KiB After Width: | Height: | Size: 4.9 KiB |
Reference in New Issue
Block a user