http://www.w3.org/ns/prov#value | - Basically you have to start in the upper left corner and call the function for each of the 8 neighbors, if one of them is a match, you add it to a queue and look at its 8 neighbors later...when there are no further matches, you ++ the label and start with the next value in your original Array.
|