UVA 10092 - The Problem with the Problem Setter

  1  /*
  2  Problem link
  3  Type: Graph - Maximum Flow
  4  Algorithm:

UVa 11747 - Heavy Cycle Edges

  1  /*
  2  Problem type: Graph - MST
  3  Algorithm: Find the Minimum Spanning Tree (MST) (using Kruskal,
  4      Prim) and print out all the edges which are not included in the MST.
  5  */