Documentation for fb5e00f5fb

d8/d95/vector__ops_8hpp_source.html

@@ -643,6 +643,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a8809e6df990f37c85c06474dd955cb2b"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a8809e6df990f37c85c06474dd955cb2b">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer &amp; operator=(const DenseLayer &amp;layer)=default</div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:155</div></div>
 <div class="ttc" id="anamespaceis__graph__bipartite_html"><div class="ttname"><a href="../../de/d83/namespaceis__graph__bipartite.html">is_graph_bipartite</a></div><div class="ttdoc">Functions for checking whether a graph is bipartite or not.</div></div>
 <div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:70</div></div>
 <div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
@@ -660,6 +661,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="anamespacemachine__learning_html_a2055c2f3a076b3d4146aade5eb35666d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d">machine_learning::operator/</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator/(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:365</div></div>
 <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a67249e31221231cf3aaf3cfd870372d0"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0">operator+</a></div><div class="ttdeci">std::vector&lt; T &gt; operator+(std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:204</div></div>
 <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:69</div></div>
+<div class="ttc" id="anamespacelinear__algebra_html"><div class="ttname"><a href="../../d3/d78/namespacelinear__algebra.html">linear_algebra</a></div><div class="ttdoc">Linear Algebra algorithms.</div></div>
 <div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:98</div></div>
 <div class="ttc" id="anamespacemachine__learning_html_ad9d119e7520fa5c2d2428433f578c0bc"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:102</div></div>
 <div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
@@ -790,6 +792,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a98eb5807f21b783c341cab402ced6732"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;v)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:22</div></div>
 <div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &amp;graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:212</div></div>
 <div class="ttc" id="agraph_2dijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:113</div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_aed4d308f46ca1d91e348ca260ec1d2fb"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">linear_algebra::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:53</div></div>
 <div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:537</div></div>
 <div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:158</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a0ee425af6fd83a033c021128b8253f52"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a0ee425af6fd83a033c021128b8253f52">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; &amp;Y)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:606</div></div>
@@ -806,6 +809,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="aadaline__learning_8cpp_html_a52053d88ea1bcbbed9aca67ab4eeb499"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a></div><div class="ttdeci">void test1(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:224</div></div>
 <div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div>
 <div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:71</div></div>
 <div class="ttc" id="anamespaceneural__network_html"><div class="ttname"><a href="../../d0/d2e/namespaceneural__network.html">neural_network</a></div><div class="ttdoc">Neural Network or Multilayer Perceptron.</div></div>
 <div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:45</div></div>
 <div class="ttc" id="anamespacegraph_html_a2e6017a54d445819ede9adcf33240e1a"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt;&gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:99</div></div>
@@ -929,6 +933,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="ahopcroft__karp_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:306</div></div>
 <div class="ttc" id="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:133</div></div>
 <div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:213</div></div>
 <div class="ttc" id="aclasshash__chain_html_a48236d44349c3ebce4774b706f4f8a0f"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain::next</a></div><div class="ttdeci">std::shared_ptr&lt; struct Node &gt; next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition:</b> chaining.cpp:23</div></div>
 <div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a35ab6f1b2840f89a858ca36b78739b69"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a35ab6f1b2840f89a858ca36b78739b69">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;kernel)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:183</div></div>
@@ -1030,6 +1035,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="anamespacespirograph_html_aeca22dbe4563358960e907a40cd3e1ac"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph::spirograph</a></div><div class="ttdeci">void spirograph(std::array&lt; std::pair&lt; double, double &gt;, N &gt; *points, double l, double k, double rot)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:70</div></div>
 <div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a60151e19512b48cc0b14ea121df00488"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor::lowest_common_ancestor</a></div><div class="ttdeci">int lowest_common_ancestor(int u, int v) const</div><div class="ttdoc">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:164</div></div>
 <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
+<div class="ttc" id="anamespacegram__schmidt_html"><div class="ttname"><a href="../../d4/d0f/namespacegram__schmidt.html">gram_schmidt</a></div><div class="ttdoc">Functions for Gram Schmidt Orthogonalisation Process</div></div>
 <div class="ttc" id="aclasshash__chain_html_a706964ad13587fc9a8b3fe8381d410ed"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain::display</a></div><div class="ttdeci">void display()</div><div class="ttdoc">Display the chain.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:63</div></div>
 <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:75</div></div>
 <div class="ttc" id="ashortest__common__supersequence_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:164</div></div>

d8/d96/gram__schmidt_8cpp__incl.map

@@ -0,0 +1,7 @@
+<map id="linear_algebra/gram_schmidt.cpp" name="linear_algebra/gram_schmidt.cpp">
+<area shape="rect" id="node1" title="Gram Schmidt Orthogonalisation Process" alt="" coords="110,5,245,47"/>
+<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/>
+<area shape="rect" id="node3" title=" " alt="" coords="102,95,167,121"/>
+<area shape="rect" id="node4" title=" " alt="" coords="192,95,251,121"/>
+<area shape="rect" id="node5" title=" " alt="" coords="275,95,325,121"/>
+</map>

d8/d96/gram__schmidt_8cpp__incl.md5

@@ -0,0 +1 @@
+0742438f0791023906f8b71fe551db42

d8/d96/gram__schmidt_8cpp__incl.svg

@@ -0,0 +1,83 @@
+<?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.44.1 (20200629.0846)
+ -->
+<!-- Title: linear_algebra/gram_schmidt.cpp Pages: 1 -->
+<svg width="248pt" height="95pt"
+ viewBox="0.00 0.00 248.00 95.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 91)">
+<title>linear_algebra/gram_schmidt.cpp</title>
+<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 244,-91 244,4 -4,4"/>
+<!-- Node1 -->
+<g id="node1" class="node">
+<title>Node1</title>
+<g id="a_node1"><a xlink:title="Gram Schmidt Orthogonalisation Process">
+<polygon fill="#bfbfbf" stroke="black" points="78.5,-56.5 78.5,-86.5 179.5,-86.5 179.5,-56.5 78.5,-56.5"/>
+<text text-anchor="start" x="86.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_algebra/gram</text>
+<text text-anchor="middle" x="129" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_schmidt.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="node2" class="node">
+<title>Node2</title>
+<g id="a_node2"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/>
+<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node2 -->
+<g id="edge1" class="edge">
+<title>Node1&#45;&gt;Node2</title>
+<path fill="none" stroke="midnightblue" d="M104.83,-56.4C88.48,-46.86 66.99,-34.32 50.73,-24.84"/>
+<polygon fill="midnightblue" stroke="midnightblue" points="52.24,-21.67 41.84,-19.66 48.72,-27.72 52.24,-21.67"/>
+</g>
+<!-- Node3 -->
+<g id="node3" class="node">
+<title>Node3</title>
+<g id="a_node3"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="72.5,-0.5 72.5,-19.5 121.5,-19.5 121.5,-0.5 72.5,-0.5"/>
+<text text-anchor="middle" x="97" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node3 -->
+<g id="edge2" class="edge">
+<title>Node1&#45;&gt;Node3</title>
+<path fill="none" stroke="midnightblue" d="M121.42,-56.4C116.96,-48.11 111.28,-37.55 106.52,-28.71"/>
+<polygon fill="midnightblue" stroke="midnightblue" points="109.48,-26.81 101.66,-19.66 103.31,-30.12 109.48,-26.81"/>
+</g>
+<!-- Node4 -->
+<g id="node4" class="node">
+<title>Node4</title>
+<g id="a_node4"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="140,-0.5 140,-19.5 184,-19.5 184,-0.5 140,-0.5"/>
+<text text-anchor="middle" x="162" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node4 -->
+<g id="edge3" class="edge">
+<title>Node1&#45;&gt;Node4</title>
+<path fill="none" stroke="midnightblue" d="M136.82,-56.4C141.47,-48.02 147.4,-37.33 152.34,-28.42"/>
+<polygon fill="midnightblue" stroke="midnightblue" points="155.41,-30.1 157.2,-19.66 149.29,-26.71 155.41,-30.1"/>
+</g>
+<!-- Node5 -->
+<g id="node5" class="node">
+<title>Node5</title>
+<g id="a_node5"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="202,-0.5 202,-19.5 240,-19.5 240,-0.5 202,-0.5"/>
+<text text-anchor="middle" x="221" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node5 -->
+<g id="edge4" class="edge">
+<title>Node1&#45;&gt;Node5</title>
+<path fill="none" stroke="midnightblue" d="M150.8,-56.4C165.41,-46.95 184.57,-34.56 199.18,-25.11"/>
+<polygon fill="midnightblue" stroke="midnightblue" points="201.12,-28.03 207.61,-19.66 197.32,-22.15 201.12,-28.03"/>
+</g>
+</g>
+</svg>