causal_networkx.graphs.dag.DAG.predecessors

DAG.predecessors(u)

Return predecessors of node u.

A predecessor is defined as nodes with a directed edge to ‘u’. That is ‘v’ -> ‘u’. A bidirected edge would not qualify as a predecessor.