That's pretty cool.  Is there any way to estimate the runtime on an unexplored graph?  At least the worst case runtime?  How is the branching factor b calculated or estimated?  Does this work on directed graphs?
spam lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor creativity violence