Java Algorithms

Divide and Conquer
Greedy Algorithms
Dynamic Programming
Backtracking
Graph Traversal
1. Applications
  1. Basic Graph Traversal Techniques (DFS, BFS)
  2. Game Theory and Decision Making
    1. Minimax Algorithm - Used for optimizing decision making in game theory, typically in two-player games.
  3. Pathfinding Algorithms
    1. A* Algorithm - A best-first search algorithm that finds the least-cost path from a start node to a goal node.
2. Shortest-Paths Problem
  1. Single Source/Destination
  2. Multiple Sources/Destinations
3. Minimum Spanning Trees
4. Maximum Flow Problem
  1. Maximum Flow in Transport Networks