# Graph Algorithms

- [Connect Component](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/connect_component.md)
- [Bipartiteness](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/bipartiteness.md)
- [Strongly Connected Components](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/strongly_connected_components.md)
- [Implementation](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/strongly_connected_components/implementation.md)
- [Topological Sort](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/topological_sorting.md)
- [Implementation 1](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/topological_sorting/implementation.md)
- [Implementation 2](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/topological_sorting/implementation-2.md)
- [Dijkstra’s Shortest Path](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/shortest_paths.md)
- [Minimum Spanning Tree](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/minimum_spanning_tree.md)
- [Prims](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/minimum_spanning_tree/prims.md)
- [Implementation 1](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/minimum_spanning_tree/prims/implementation-1.md)
- [Kruskels](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/minimum_spanning_tree/kruskels.md)
- [Implementation 1](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/minimum_spanning_tree/kruskels/implementation-1.md)
- [Traveling Salesman Problem](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/minimum_spanning_tree/traveling-salesman-problem.md)
- [k-Clustering](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/k-clustering.md)
- [Dynamic Programming with Trees](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/dynamic-programming-with-trees.md)
- [Implementation 1](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/dynamic-programming-with-trees/implementation-1.md)
- [Implementation 2](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/dynamic-programming-with-trees/implementation-2.md)
- [Disjoint Sets](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/disjoint-sets.md)
- [Implementation](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/disjoint-sets/implementation.md)
- [Eularian Cycle](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/eularian-cycle.md)
- [Implementation](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/eularian-cycle/implementation.md)
- [Hamiltonian Path](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/hamiltonian-path.md)
- [Implementation](/ecs122a-algorithm-design-lecture-notes/basic_graph_algorithms/hamiltonian-path/implementation.md)