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

Documentation for 2c68b68ca6

Browse Source
This commit is contained in:
github-actions
2023-07-25 01:00:26 +00:00
parent e9138e9e94
commit dc4d3f2965
66 changed files with 736 additions and 646 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
functions_a.html
View File

@@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('functions_a.html',''); initResizable()
<li>adaline()&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c">machine_learning::adaline</a></li>
<li>add()&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">data_structures::Bitset</a>, <a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">data_structures::BloomFilter&lt; T &gt;</a>, <a class="el" href="dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<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="d3/d64/classgreedy__algorithms_1_1_graph.html#a0672b080707aaaacf9cc116d69ea4c3f">greedy_algorithms::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>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>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#ad8c10df34357b2cd865c81e0c4f0bd8c">graph::is_graph_bipartite::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>