Duestion 1: (5pts) One of the well-known applications on graphs is the Dijikstra algorithm. In addition to the set of ve
Posted: Sat May 14, 2022 3:38 pm
Duestion 1: (5pts) One of the well-known applications on graphs is the Dijikstra algorithm. In addition to the set of vertices and edges, we assign to each edge a cost that can represent many things depending on the context it is used in. Home 5 E B 1 F D A 1) Apply dijikstra to find the shortest path between home and university.(2pts) 2) What is the complexity of this algorithm if a binary heap is used for implementation?(1pt) 3) Apply any algorithm that finds a MST of the graph in 6).(2pts)