I.e. without altering the graph by removing edges?

Q only contains the initial vertices that have no incoming edges?

Shouldn’t there be a pass after removing u’s outgoing edges to add the vertices that no longer contain any incoming edges?

public class Boyer_Moore_Bonfield {

static String result = null;

static String haystack = “BERINGBEARINGATLANTICPACIFIC WE HOLD THESE TRUTHS TO BE SELF-EVIDENT PACIFYBALTICCONCERTOOTHERWISECASPIAN Z”;

static String needle = “”;

public static void main(String[] args){

java.util.Scanner input = new java.util.Scanner(System.in);

while(!(needle.equals(“-1”))){

System.out.println(“\nEnter a word or string to search for . . . \n”);

needle = input.nextLine().toUpperCase();

System.out.println(search_for(needle, haystack)+”\n”);

}
}

static String search_for(String needl, String haystac){

int lenNeedle = needl.length();
int lenHaystack = haystac.length();
int needlePointer;
int haystackPointer = lenNeedle-1;
int flexHaystackPointer = haystackPointer;
boolean matched = false;

while (haystackPointer < lenHaystack){

needlePointer = lenNeedle-1;
flexHaystackPointer = haystackPointer;

while(haystac.charAt(flexHaystackPointer)==needl.charAt(needlePointer)){

//System.out.println("needlePointer is "+needlePointer+" flexHaystackPointer is "+flexHaystackPointer);//DEBUG

if(needlePointer==0){

matched=true;
break;
}

flexHaystackPointer–;
needlePointer–;
}
if(!matched){

if( (needl.lastIndexOf(haystac.charAt(flexHaystackPointer)) == -1) ){

//the char is not in the pattern at all
// so move the pattern right by the length of the pattern
haystackPointer += needl.length();
}

else{
haystackPointer += needl.length()-needl.lastIndexOf(haystac.charAt(flexHaystackPointer))-1;
}
}

if(matched){break;}
}

if(matched){
return("Found : "+haystac.substring(flexHaystackPointer,flexHaystackPointer+lenNeedle));
}
else{
return("No match");
}
}
}