A simple students project implementing Dinic's Algorithm to compute the max flow/min cut of a network.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 

13 lines
249 B

#pragma once
typedef int VertexID;
typedef int Capacity;
typedef int Flow;
typedef struct Arc {
VertexID start;
VertexID end;
Capacity capacity;
Capacity residual_capacity; // might not be needed
Flow flow; // might not be needed
} Arc;