Shortest Path Trees

Home > Mathematics > Graph theory > Weighted Graphs > Shortest Path Trees

A tree that connects a source vertex to all other vertices in a weighted graph such that the sum of the edge weights is minimized.