The program* can read any (directional) line given in this format and tell whether the (directed) graph contains cycles, order the nodes of an acyclic graph topologically, calculate the shortest distance between any two given nodes of an acyclic graph
We can define a directed graph by ordering its nodes and arcs. First consider a TXT file in which nodes of string type are given, followed by arcs in sequential triples and associated weights. For example: B A D C (C, D, 1) (A, B, 1) (B, D, 3) (B, C, 0) (A, C, 2) The program* can read any (directional) line given in this format and tell whether the (directed) graph contains cycles, order the nodes of an acyclic graph topologically, calculate the shortest distance between any two given nodes of an acyclic graph (if there is a path between these two nodes) under the assumption that arc weights are not negative. (Dijkstra
Step by step
Solved in 3 steps
