Shortest path (A, C, E, D, F) between vertices A and F in the weighted directed graph