which is related to path searches such as Dijkstra's algorithm, Prim's algorithm or Kruskal's algorithm ... And I should find a path by implementing a shortest path seatch on the graph by using algorithms code ... what we covered in class-GraphThe graph consists of a set of vertices and a set of edges.