Write a Python program that reads an adjacency matrix from a .txt file called "input.txt" then performs a Dijkstras Algorithm with Dial's implementation to find the shortest path.

The graph is given below along with the associated weight of each arc.