What is the difference between a minimum spanning tree and a shortest path in graph theory?

In graph theory, a minimum spanning tree is a tree that connects all the vertices of a graph with the minimum possible total edge weight, while a shortest path is the path with the minimum total weight between two specific vertices in a graph. In essence, a minimum spanning tree focuses on connecting all vertices with the least total weight, while a shortest path focuses on finding the path with the least weight between two specific vertices.