Code Library Of Others/sgtlaugh/Dinic_s Algorithm (Edge List).cpp
inline void addEdge(int a, int b, long long c){
        adj[a].push_back(E.size());
        E.push_back(Edge(a, b, c, 0));
        len[a]++;
        adj[b].push_back(E.size());
        E.push_back(Edge(b, a, 0, 0));
        len[b]++;
    }
/// Adds a directed edge with capacity c
Adds a directed edge with capacity c
Adds a directed edge with capacity c
inline void addEdge(int a, int b, long long c){
        adj[a].push_back(E.size());
        E.push_back(Edge(a, b, c, 0));
        len[a]++;
        adj[b].push_back(E.size());
        E.push_back(Edge(b, a, 0, 0));
        len[b]++;
    }
inline void addEdge ( int a , int b , long long c ) { adj [ a ] . push_back ( E . size ( ) ) ; E . push_back ( Edge ( a , b , c , 0 ) ) ; len [ a ] ++ ; adj [ b ] . push_back ( E . size ( ) ) ; E . push_back ( Edge ( b , a , 0 , 0 ) ) ; len [ b ] ++ ; }
Adds a directed edge with capacity c
Adds a directed edge with capacity c