This question is just for discussing algorithms please and not for proposing algorithms. I saw very similar post to mine, but still the answer explains definitions online for topological ordering.
Suppose we have a DAG (directed acyclic graph). Regarding the problem of finding shortest paths, Dijkstra's and Bellman-Ford algorithms are very popular. While both work with weighted directed graph, Bellman-Ford algorithm can work with negative edges. Dijkstra takes $O(E\log{E})$ while Bellman-Ford algorithm takes $O(EV)$ to execute, where $E$ is the number of edges and $V$ is the number of vertices in graph $G$.
Now here comes my issue, topological ordering works by just numbering the order by which we will visit the vertices of a graph and it works with negative edges as well, so this is a pro over Dijkstra. Because of topological ordering, we speed up shortest path finding to just linear time to $O(E+V)$.
Problem: Could you please simply explain the logic behind introducing topological sorting and how it helps cutting down complexity to just $O(E+V)$?