check if there 's any k sum path that   terminates at this node   Traverse the entire path as   there can be negative elements too
int f = 0 ; for ( int j = path . size ( ) - 1 ; j >= 0 ; j -- ) { f += path . get ( j ) ;