mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-13 12:49:43 +08:00
24 lines
1.2 KiB
XML
24 lines
1.2 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 2.50.0 (20211204.2007)
|
|
-->
|
|
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
|
<svg width="131pt" height="39pt"
|
|
viewBox="0.00 0.00 131.00 39.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 35)">
|
|
<title>Graphical Class Hierarchy</title>
|
|
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 127,-35 127,4 -4,4"/>
|
|
<!-- Node0 -->
|
|
<g id="node1" class="node">
|
|
<title>Node0</title>
|
|
<g id="a_node1"><a xlink:href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_top" xlink:title="Class for representing graph as an adjacency list.">
|
|
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 123,-30.5 123,-0.5 0,-0.5"/>
|
|
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
|
|
<text text-anchor="middle" x="61.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
</g>
|
|
</svg>
|