Graph Programs cs图程序.nott.ac.uk.pptVIP

Graph Programs for Graph Algorithms Sandra Steinert and Detlef Plump The University of York 22/03/05 Example: Graph Algorithm in C (Sedgewick) Graph Program Simple_Dijkstra (Conditional) Rule Schemata Graph Programs Graph Program Simple_Dijkstra Results for Simple_Dijkstra Proposition: Simple_Dijkstra always terminates (follows easily from rules) (2) Correctness: started from a graph containing an unique node s with tag _0, Simple_Dijkstra produces the graph which is obtained by labelling each node v with the shortest distance from s to v Complexity worst case: exponential in the number