Inside a directed graph, a Strongly Related Ingredient is usually a subset of vertices where by each and every vertex during the subset is reachable from every other vertex in precisely the same subset by traversing the directed edges. Findin$begingroup$ I think I disagree with Kelvin Soh somewhat, in that he appears to allow for a route to repeat