## Shortest Path Algorithm

Greedy

Dynamic Programming

# Relaxation

Each point has a known distance so far, if a vertex + distance to a particular point is shorter than the known distance of the point, update it. if (d…

**標籤總數**: 3

Greedy

Dynamic Programming

Each point has a known distance so far, if a vertex + distance to a particular point is shorter than the known distance of the point, update it. if (d…

Graph Theory

Greedy

Minimum spanning tree is defined as given graph(G) which a set of vertexes and edges with weights. Find a path which connects all vertexes…