Lecture 04

Running Dijsktra's algorithm on a graph using a Fibonacci heap instead of a Binary heap reduces the time complexity from $O(n^2 \log{n})$ to $O(n^2)$ for densely connected graphs.

A tree is considered to be a spanning tree if there exists a path from every node in the graph to reach one another using the edges that compose the spanning tree.

Note: The graph is assumed to be undirected.

A spanning tree is considered to be a minimum spanning tree if the total cost of the edges in the spanning tree is the lowest cumulative cost possible.

Note: The graph is assumed to be undirected.

Docs just now