Skeleton of a directed graph
= Skeleton of a directed graph
The skeleton of a <directed graph> is the <undirected graph> obtained by replacing every directed edge with an undirected edge and forgetting its orientation. In causal structure learning, the <PC algorithm> first recovers this adjacency structure before learning orientations.