Method get_pred

cpp_easygraph/classes/directed_graph.cpp:579–594

}

py::object DiGraph::get_pred() {
    adj_dict_factory pred = this->pred;
    py::dict predecessors = py::dict();
    for (const auto& ego_edges : this->pred) {
        node_t start_point = ego_edges.first;
        py::dict ego_edges_dict = py::dict();
        for (const auto& edge_info : ego_edges.second) {
            node_t end_point = edge_info.first;
            const auto& edge_attr = edge_info.second;
            ego_edges_dict[this->id_to_node[py::cast(end_point)]] = attr_to_dict(edge_attr);
        }
        predecessors[this->id_to_node[py::cast(start_point)]] = ego_edges_dict;
    }

    return predecessors;
}

py::object DiGraph::get_edges() {
    py::list edges = py::list();