Shortest Path in Directed Acyclic Graph

Given a directed acyclic graph (DAG) with weighted edges, find the shortest path from a given source vertex m to all other vertices in the graph using a topological sorting approach. Return the shortest distances to all vertices.