Use v2ec to verify the augmentation of a subgraph.

Usage: v2ec <instance file> <solution file>

Example:

v2ec probE3.ins probE3.sol

(Note that this is just an example and the solution is not optimal.)

Given an instance file (*.ins) and a solution file (*.aug or *.sol) as
input the program will verify the following:

   1. All edges in the solution file are edges in the instance file.
   2. The solution in the solution file is a feasible solution to the
   problem defined by the instance file.  
   3. Output the total cost of the augmentation.

The program uses Tarjan's algorithm to check whether there are any bridges in
the graph A(V,F U X).

Vertices start from 1. Weights could be in principle real values but
this choice is highly dicouraged. Integer values should be instead
preferred.

Formats:

Instance File Format (.ins)

c    comment
p    name NODES EDGES
t    u v
e    u v w

Example:

p probEx 11 22
t 0 1
t 1 2
t 1 3
t 2 3
t 3 4
t 3 5
t 5 6
t 5 8
t 5 9
t 6 7
t 6 8
t 9 10
e 0 4 8
e 0 2 5
e 1 4 11
e 2 6 3
e 3 6 4
e 4 10 4
e 5 7 2
e 5 10 1
e 6 9 2
e 7 8 1
e 8 9 6

Solution File Format (.aug)

c    comment
a    u v

Example:

a 0 4
a 4 10
a 7 8

