graph Directory Reference

## Files

file | bidirectional_dijkstra.cpp
| Bidirectional Dijkstra Shortest Path Algorithm
file | breadth_first_search.cpp
| Breadth First Search Algorithm (Breadth First Search)
file | connected_components.cpp
| <a href="https://en.wikipedia.org/wiki/Component_(graph_theory)"
file | connected_components_with_dsu.cpp
| Disjoint union
file | depth_first_search.cpp
| Depth First Search Algorithm (Depth First Search)
file | depth_first_search_with_stack.cpp
| Depth First Search Algorithm using Stack (Depth First Search Algorithm)
file | dijkstra.cpp
| <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
file | hamiltons_cycle.cpp
| The implementation of Hamilton's cycle dynamic solution for vertices number less than 20.
file | hopcroft_karp.cpp
| Implementation of Hopcroft–Karp algorithm.
file | is_graph_bipartite.cpp
| Algorithm to check whether a graph is bipartite
file | lowest_common_ancestor.cpp
| Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting.