{"ast_node_type":"other","tokens":[{"end":96,"kind":"keyword","start":0,"text":"///"}]}
    /// relations, which will be later used as the basis for the transitive closure computation.
    /// Lists all the base edges in the graph: the initial _non-transitive_ set of element
    pub fn base_edges(&self) -> impl Iterator<Item = (T, T)> {