Notebook/src-bkp/Mo Algorithm - Values in Edges.cpp
void fix(int node, int color){
    if(color != 0){
        if(seen[node] == 1){
            remove(color);
        }else{
            add(color);
        }
        seen[node] ^= 1;
    }
}
//If a node is visited 0 or two times, then,
//this node is not part of path A and B.
If a node is visited 0 or two times, then,
this node is not part of path A and B.
If a node is visited 0 or two times then this node is not part of path A and B .
void fix(int node, int color){
    if(color != 0){
        if(seen[node] == 1){
            remove(color);
        }else{
            add(color);
        }
        seen[node] ^= 1;
    }
}
void fix ( int node , int color ) { if ( color != 0 ) { if ( seen [ node ] == 1 ) { remove ( color ) ; } else { add ( color ) ; } seen [ node ] ^= 1 ; } }
If a node is visited 0 or two times, then,
this node is not part of path A and B.
If a node is visited 0 or two times then this node is not part of path A and B .