Making Loop-Finding Faster: Numpy Equivalent of Pandas Merge?

Question

I start with a list of parent/child (edge) relationships in a directed graph, like this:

import numpy as np
import pandas as pd

df = pd.DataFrame(columns=[\'