backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 06:12:11 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 85d62bb80d

Browse Source
This commit is contained in:
realstealthninja
2024-11-01 17:23:36 +00:00
parent db0fed538b
commit 589b446f88
297 changed files with 3602 additions and 1265 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
functions_func_a.html
View File

@@ -115,7 +115,7 @@ $(function(){initNavTree('functions_func_a.html',''); initResizable(true); });
<li>add_digit()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">large_number</a></li>
<li>add_edge()&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph&lt; T &gt;</a>, <a class="el" href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">greedy_algorithms::dijkstra::Graph</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>addBinary()&#160;:&#160;<a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition</a></li>
<li>addEdge()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph</a>, <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph</a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">graph::is_graph_bipartite::Graph</a></li>
<li>addEdge()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph</a>, <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph</a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">graph::is_graph_bipartite::Graph</a>, <a class="el" href="d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">graph::topological_sort::Graph</a></li>
<li>addProcess()&#160;:&#160;<a class="el" href="dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS&lt; S, T, E &gt;</a></li>
<li>addVertices()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph</a></li>
<li>arg()&#160;:&#160;<a class="el" href="da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">Complex</a></li>