Function build_graph

src/ccsr/src/client.rs:942–956

Helper to build a graph from a list of edges. Each edge is (from, to) meaning "from" depends on "to". We take the root separately to build a graph without edges.

(
        edges: &[(SubjectVersion, Option<SubjectVersion>)],
    )

    ///
    /// We take the root separately to build a graph without edges.
    fn build_graph(
        edges: &[(SubjectVersion, Option<SubjectVersion>)],
    ) -> HashMap<SubjectVersion, Vec<SubjectVersion>> {
        let mut graph: HashMap<SubjectVersion, Vec<SubjectVersion>> = HashMap::new();

        // Add edges: from depends on to
        for (from, to) in edges {
            let deps = graph.entry(from.clone()).or_default();
            if let Some(to) = to {
                deps.push(to.clone());
            }
        }

        graph
    }

    /// Verify that all edges are respected in the ordering.
    /// For edge (from, to) where 'from' depends on 'to':