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

  1. #pragma once
  2. typedef int VertexID;
  3. typedef int Capacity;
  4. typedef int Flow;
  5. typedef struct Arc {
  6. VertexID start;
  7. VertexID end;
  8. Capacity capacity;
  9. Capacity residual_capacity; // might not be needed
  10. Flow flow; // might not be needed
  11. } Arc;