Dependency Ordering With Topological Sort

You are given dependency rules as a 2D array of strings. In each row, the first string depends on the remaining strings in that row. Return an ordering where every dependency appears before the item that depends on it.