mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
0b27a9e631
* feat: Add BFS and DFS algorithms to check for cycle in a directed graph * Remove const references for input of simple types Reason: overhead on access * fix bad code sorry for force push * Use pointer instead of the non-const reference because apparently google says so. * Remove a useless and possibly bad Graph constuctor overload * Explicitely specify type of vector during graph instantiation * Minor documentation fixes. * Fix bad code why did I even do this lol. * Some more fixes to the code * Fix a comment. * Use map instead of unordered_map for better performance when using map.find() function and make code compatible with C++11. * Remove copyright line. |
||
---|---|---|
.. | ||
bfs.cpp | ||
bridge_finding_with_tarjan_algorithm.cpp | ||
connected_components_with_dsu.cpp | ||
connected_components.cpp | ||
cycle_check_directed_graph.cpp | ||
dfs_with_stack.cpp | ||
dfs.cpp | ||
dijkstra.cpp | ||
kosaraju.cpp | ||
kruskal.cpp | ||
lca.cpp | ||
max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp | ||
prim.cpp | ||
topological_sort_by_kahns_algo.cpp | ||
topological_sort.cpp |