(int garden,int path[][],int output[],int color)
| 24 | } |
| 25 | |
| 26 | public boolean isFeasible(int garden,int path[][],int output[],int color) |
| 27 | { |
| 28 | for(int i=0;i<path.length;i++) |
| 29 | { |
| 30 | if(path[i][0]==garden) |
| 31 | { |
| 32 | if(output[path[i][1]-1]==color) return false; |
| 33 | } |
| 34 | else if(path[i][1]==garden) |
| 35 | { |
| 36 | if(output[path[i][0]-1]==color) return false; |
| 37 | } |
| 38 | } |
| 39 | return true; |
| 40 | } |
| 41 | } |