This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview:  V  ,  E  ; the former is the number of vertices and the latter is the number of edges. Each of the following  E  rows denotes a single edge. In each of these lines, there are three integers; the Frst is the source vertex, the second is the target vertex and the third is the edge weight. You can suppose that the graph is simple and it consists of at most 100 vertices. Output Each row of the output Fle contains integers v, d , which denotes the operation Transfer(v,d) . If there is no solution to the given graph, the output should contain the single string “NO SOLUTION”. Sample Input 4 5 2 3 4 4 2 5 3 4 2 3 1 0 1 2 1 1 Output for Sample Input 3 3 1 2 2...
View
Full Document
 Spring '11
 Dolatabadi
 Graph Theory, Addition, Discrete Mathematics Computer Assignment

Click to edit the document details