# Graph Algorithms

**Dijskstra’s Algorithm **finds the shortest path from a single node to every other node

It is a greedy algorithm (similar to Prim’s algorithm)

**Topological Sort**

**Motivating Example (reference)**

**Minimum Spanning Tree**

Given a connected and undirected graph, a *spanning tree* of that graph is a subgraph that is a tree and connects all the vertices together

References

### Like this:

Like Loading...