java:algorithms
Differences
This shows you the differences between two versions of the page.
| java:algorithms [2024/04/26 12:47] – created odefta | java:algorithms [2024/04/26 12:51] (current) – odefta | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Java Algorithms ====== | ====== Java Algorithms ====== | ||
| - | | + | |
| - **Greedy Algorithms** | - **Greedy Algorithms** | ||
| - **Dynamic Programming** | - **Dynamic Programming** | ||
| Line 8: | Line 8: | ||
| - **Applications** | - **Applications** | ||
| - **Basic Graph Traversal Techniques (DFS, BFS)** | - **Basic Graph Traversal Techniques (DFS, BFS)** | ||
| + | - **Game Theory and Decision Making** | ||
| + | - **Minimax Algorithm** - Used for optimizing decision making in game theory, typically in two-player games. | ||
| + | - **Pathfinding Algorithms** | ||
| + | - **A* Algorithm** - A best-first search algorithm that finds the least-cost path from a start node to a goal node. | ||
| - **Shortest-Paths Problem** | - **Shortest-Paths Problem** | ||
| - **Single Source/ | - **Single Source/ | ||
| Line 14: | Line 18: | ||
| - **Maximum Flow Problem** | - **Maximum Flow Problem** | ||
| - **Maximum Flow in Transport Networks** | - **Maximum Flow in Transport Networks** | ||
| + | |||
| | | ||
java/algorithms.txt · Last modified: 2024/04/26 12:51 by odefta