Function project_graph 

pub fn project_graph(dict: &Dictionary, triples: &[(u32, u32, u32)]) -> Graph

Project RDF integer triples onto the undirected node graph the pyramid clusters: one node per distinct term (via the dictionary’s unified node space), one unit-weight edge per (subject, object) pair (predicates are ignored for clustering; parallel edges accumulate weight).