check that the preflow satisfies height constraints concode_field_sep Queue<Vertex> workList concode_elem_sep boolean graphModified concode_elem_sep Hashtable<String,Vertex> vertices concode_elem_sep Vertex sink concode_elem_sep SimpleGraph G concode_elem_sep int resultFlow concode_elem_sep HashMap<Vertex,Boolean> active concode_elem_sep Vertex source concode_elem_sep String BIP_G1 concode_elem_sep int N concode_elem_sep String MY_TEST_G1 concode_elem_sep int labelCount[] concode_elem_sep String BIPARTITE concode_field_sep boolean validateExcessforNodes concode_elem_sep boolean admissible concode_elem_sep void addToWorkList concode_elem_sep double findMaxFlow concode_elem_sep void discharge concode_elem_sep boolean validateMaxFlow concode_elem_sep void main concode_elem_sep boolean validateAugmentPathDoesntExist concode_elem_sep void Push concode_elem_sep double findMinCut concode_elem_sep void gapRelabel concode_elem_sep void relabel
boolean function ( ) { for ( Vertex loc0 : vertices . values ( ) ) { for ( Edge loc1 : loc0 . getResidualOutEdges ( ) ) { Vertex loc2 = G . opposite ( loc0 , loc1 ) ; if ( loc1 . remaining ( ) > 0 && loc0 . getHeight ( ) > loc2 . getHeight ( ) + 1 ) return false ; } } return true ; }