Can you name algorithms used to find the shortest path between two points in a graph?

To find the shortest path between two points in a graph, the following algorithms are often used:

• Dijkstra's Algorithm — finds the shortest path from one vertex to all others in a graph with non-negative edge weights.
• Bellman-Ford Algorithm — works with graphs that may have negative edge weights and detects negative cycles.
• A* Algorithm — a heuristic algorithm that speeds up the search for the shortest path by using heuristics to estimate the distance to the goal.
• Floyd-Warshall Algorithm — finds the shortest paths between all pairs of vertices.

An example of using Dijkstra's algorithm in Java typically involves a graph structure and a priority queue to select the next vertex with the minimal distance.