mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 22:32:24 +08:00
178 lines
17 KiB
HTML
178 lines
17 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||
<meta name="generator" content="Doxygen 1.14.0"/>
|
||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
<title>TheAlgorithms/C++: graph Directory Reference</title>
|
||
<link rel="icon" href="favicon.svg" type="image/x-icon" />
|
||
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="jquery.js"></script>
|
||
<script type="text/javascript" src="dynsections.js"></script>
|
||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||
<script type="text/javascript">
|
||
DoxygenAwesomeDarkModeToggle.init()
|
||
</script>
|
||
<script type="text/javascript" src="clipboard.js"></script>
|
||
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="navtreedata.js"></script>
|
||
<script type="text/javascript" src="navtree.js"></script>
|
||
<script type="text/javascript" src="cookie.js"></script>
|
||
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="search/searchdata.js"></script>
|
||
<script type="text/javascript" src="search/search.js"></script>
|
||
<script type="text/javascript">
|
||
window.MathJax = {
|
||
options: {
|
||
ignoreHtmlClass: 'tex2jax_ignore',
|
||
processHtmlClass: 'tex2jax_process'
|
||
},
|
||
loader: {
|
||
load: ['[tex]/ams']
|
||
},
|
||
tex: {
|
||
macros: {},
|
||
packages: ['base','configmacros','ams']
|
||
}
|
||
};
|
||
</script>
|
||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
||
<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||
</head>
|
||
<body>
|
||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||
<div id="titlearea">
|
||
<table cellspacing="0" cellpadding="0">
|
||
<tbody>
|
||
<tr id="projectrow">
|
||
<td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
|
||
<td id="projectalign">
|
||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||
</div>
|
||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
</div>
|
||
<!-- end header part -->
|
||
<!-- Generated by Doxygen 1.14.0 -->
|
||
<script type="text/javascript">
|
||
var searchBox = new SearchBox("searchBox", "search/",'.html');
|
||
</script>
|
||
<script type="text/javascript">
|
||
$(function() { codefold.init(); });
|
||
</script>
|
||
<script type="text/javascript" src="menudata.js"></script>
|
||
<script type="text/javascript" src="menu.js"></script>
|
||
<script type="text/javascript">
|
||
$(function() {
|
||
initMenu('',true,false,'search.php','Search',true);
|
||
$(function() { init_search(); });
|
||
});
|
||
</script>
|
||
<div id="main-nav"></div>
|
||
</div><!-- top -->
|
||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||
<div id="nav-tree">
|
||
<div id="nav-tree-contents">
|
||
<div id="nav-sync" class="sync"></div>
|
||
</div>
|
||
</div>
|
||
<div id="splitbar" style="-moz-user-select:none;"
|
||
class="ui-resizable-handle">
|
||
</div>
|
||
</div>
|
||
<script type="text/javascript">
|
||
$(function(){initNavTree('dir_12552d7fa429bf94a2e32e5cf39f7e69.html','',''); });
|
||
</script>
|
||
<div id="container">
|
||
<div id="doc-content">
|
||
<!-- window showing the filter options -->
|
||
<div id="MSearchSelectWindow"
|
||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||
</div>
|
||
|
||
<!-- iframe showing the search results (closed by default) -->
|
||
<div id="MSearchResultsWindow">
|
||
<div id="MSearchResults">
|
||
<div class="SRPage">
|
||
<div id="SRIndex">
|
||
<div id="SRResults"></div>
|
||
<div class="SRStatus" id="Loading">Loading...</div>
|
||
<div class="SRStatus" id="Searching">Searching...</div>
|
||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
|
||
<div class="header">
|
||
<div class="headertitle"><div class="title">graph Directory Reference</div></div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
<table class="memberdecls">
|
||
<tr class="heading"><td colspan="2"><h2 id="header-files" class="groupheader"><a id="files" name="files"></a>
|
||
Files</h2></td></tr>
|
||
<tr class="memitem:bidirectional_5Fdijkstra_2Ecpp" id="r_bidirectional_5Fdijkstra_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d07/bidirectional__dijkstra_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html">bidirectional_dijkstra.cpp</a></td></tr>
|
||
<tr class="memdesc:d7/d07/bidirectional__dijkstra_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) <br /></td></tr>
|
||
<tr class="memitem:breadth_5Ffirst_5Fsearch_2Ecpp" id="r_breadth_5Ffirst_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d82/breadth__first__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/d82/breadth__first__search_8cpp.html">breadth_first_search.cpp</a></td></tr>
|
||
<tr class="memdesc:df/d82/breadth__first__search_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Breadth-first_search" target="_blank">Breadth First Search Algorithm (Breadth First Search)</a> <br /></td></tr>
|
||
<tr class="memitem:bridge_5Ffinding_5Fwith_5Ftarjan_5Falgorithm_2Ecpp" id="r_bridge_5Ffinding_5Fwith_5Ftarjan_5Falgorithm_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>bridge_finding_with_tarjan_algorithm.cpp</b></td></tr>
|
||
<tr class="memitem:connected_5Fcomponents_2Ecpp" id="r_connected_5Fcomponents_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/ddd/connected__components_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/ddd/connected__components_8cpp.html">connected_components.cpp</a></td></tr>
|
||
<tr class="memdesc:df/ddd/connected__components_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Connected Components (Connected Components)] (<a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">https://en.wikipedia.org/wiki/Component_(graph_theory)</a>) <br /></td></tr>
|
||
<tr class="memitem:connected_5Fcomponents_5Fwith_5Fdsu_2Ecpp" id="r_connected_5Fcomponents_5Fwith_5Fdsu_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/d99/connected__components__with__dsu_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d99/connected__components__with__dsu_8cpp.html">connected_components_with_dsu.cpp</a></td></tr>
|
||
<tr class="memdesc:d8/d99/connected__components__with__dsu_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> <br /></td></tr>
|
||
<tr class="memitem:cycle_5Fcheck_5Fdirected_5Fgraph_2Ecpp" id="r_cycle_5Fcheck_5Fdirected_5Fgraph_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/dec/cycle__check__directed__graph_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>cycle_check_directed_graph.cpp</b></td></tr>
|
||
<tr class="memitem:depth_5Ffirst_5Fsearch_2Ecpp" id="r_depth_5Ffirst_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d8d/depth__first__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d8d/depth__first__search_8cpp.html">depth_first_search.cpp</a></td></tr>
|
||
<tr class="memdesc:da/d8d/depth__first__search_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm (Depth First Search)</a> <br /></td></tr>
|
||
<tr class="memitem:depth_5Ffirst_5Fsearch_5Fwith_5Fstack_2Ecpp" id="r_depth_5Ffirst_5Fsearch_5Fwith_5Fstack_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d4b/depth__first__search__with__stack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html">depth_first_search_with_stack.cpp</a></td></tr>
|
||
<tr class="memdesc:da/d4b/depth__first__search__with__stack_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a> <br /></td></tr>
|
||
<tr class="memitem:dijkstra_2Ecpp" id="r_dijkstra_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/d68/dijkstra_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d68/dijkstra_8cpp.html">dijkstra.cpp</a></td></tr>
|
||
<tr class="memdesc:d8/d68/dijkstra_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (<a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>) <br /></td></tr>
|
||
<tr class="memitem:hamiltons_5Fcycle_2Ecpp" id="r_hamiltons_5Fcycle_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="dd/d0c/hamiltons__cycle_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html">hamiltons_cycle.cpp</a></td></tr>
|
||
<tr class="memdesc:dd/d0c/hamiltons__cycle_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path" target="_blank">Hamilton's cycle</a> dynamic solution for vertices number less than 20. <br /></td></tr>
|
||
<tr class="memitem:hopcroft_5Fkarp_2Ecpp" id="r_hopcroft_5Fkarp_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d1/d9a/hopcroft__karp_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d9a/hopcroft__karp_8cpp.html">hopcroft_karp.cpp</a></td></tr>
|
||
<tr class="memdesc:d1/d9a/hopcroft__karp_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm" target="_blank">Hopcroft–Karp</a> algorithm. <br /></td></tr>
|
||
<tr class="memitem:is_5Fgraph_5Fbipartite_2Ecpp" id="r_is_5Fgraph_5Fbipartite_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d6/dd8/is__graph__bipartite_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html">is_graph_bipartite.cpp</a></td></tr>
|
||
<tr class="memdesc:d6/dd8/is__graph__bipartite_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Algorithm to check whether a graph is <a href="https://en.wikipedia.org/wiki/Bipartite_graph" target="_blank">bipartite</a> <br /></td></tr>
|
||
<tr class="memitem:is_5Fgraph_5Fbipartite2_2Ecpp" id="r_is_5Fgraph_5Fbipartite2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="dd/dc3/is__graph__bipartite2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>is_graph_bipartite2.cpp</b></td></tr>
|
||
<tr class="memitem:kosaraju_2Ecpp" id="r_kosaraju_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d83/kosaraju_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>kosaraju.cpp</b></td></tr>
|
||
<tr class="memitem:kruskal_2Ecpp" id="r_kruskal_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d1c/kruskal_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>kruskal.cpp</b></td></tr>
|
||
<tr class="memitem:lowest_5Fcommon_5Fancestor_2Ecpp" id="r_lowest_5Fcommon_5Fancestor_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/dde/lowest__common__ancestor_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></td></tr>
|
||
<tr class="memdesc:de/dde/lowest__common__ancestor_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting. <br /></td></tr>
|
||
<tr class="memitem:max_5Fflow_5Fwith_5Fford_5Ffulkerson_5Fand_5Fedmond_5Fkarp_5Falgo_2Ecpp" id="r_max_5Fflow_5Fwith_5Fford_5Ffulkerson_5Fand_5Fedmond_5Fkarp_5Falgo_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></td></tr>
|
||
<tr class="memitem:number_5Fof_5Fpaths_2Ecpp" id="r_number_5Fof_5Fpaths_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/d32/number__of__paths_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d32/number__of__paths_8cpp.html">number_of_paths.cpp</a></td></tr>
|
||
<tr class="memdesc:d2/d32/number__of__paths_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Algorithm to count paths between two nodes in a directed graph using DFS. <br /></td></tr>
|
||
<tr class="memitem:prim_2Ecpp" id="r_prim_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d27/prim_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>prim.cpp</b></td></tr>
|
||
<tr class="memitem:topological_5Fsort_2Ecpp" id="r_topological_5Fsort_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/db9/topological__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/db9/topological__sort_8cpp.html">topological_sort.cpp</a></td></tr>
|
||
<tr class="memdesc:d8/db9/topological__sort_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Topological_sorting" target="_blank">Topological Sort Algorithm</a> <br /></td></tr>
|
||
<tr class="memitem:topological_5Fsort_5Fby_5Fkahns_5Falgo_2Ecpp" id="r_topological_5Fsort_5Fby_5Fkahns_5Falgo_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>topological_sort_by_kahns_algo.cpp</b></td></tr>
|
||
<tr class="memitem:travelling_5Fsalesman_5Fproblem_2Ecpp" id="r_travelling_5Fsalesman_5Fproblem_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d88/travelling__salesman__problem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/d88/travelling__salesman__problem_8cpp.html">travelling_salesman_problem.cpp</a></td></tr>
|
||
<tr class="memdesc:de/d88/travelling__salesman__problem_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">[Travelling Salesman Problem] (<a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">https://en.wikipedia.org/wiki/Travelling_salesman_problem</a>) implementation <br /></td></tr>
|
||
</table>
|
||
</div><!-- contents -->
|
||
</div><!-- doc-content -->
|
||
<div id="page-nav" class="page-nav-panel">
|
||
<div id="page-nav-resize-handle"></div>
|
||
<div id="page-nav-tree">
|
||
<div id="page-nav-contents">
|
||
</div><!-- page-nav-contents -->
|
||
</div><!-- page-nav-tree -->
|
||
</div><!-- page-nav -->
|
||
</div><!-- container -->
|
||
<!-- start footer part -->
|
||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||
<ul>
|
||
<li class="navelem"><a href="dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li>
|
||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
||
</ul>
|
||
</div>
|
||
</body>
|
||
</html>
|