Function DiGraph_add_one_edge

cpp_easygraph/classes/directed_graph.cpp:276–300

}

void DiGraph_add_one_edge(DiGraph& self, py::object u_of_edge,
                          py::object v_of_edge, py::object edge_attr) {
    node_t u, v;
    if (!self.node_to_id.contains(u_of_edge)) {
        u = DiGraph_add_one_node(self, u_of_edge);
    } else {
        u = self.node_to_id[u_of_edge].cast<node_t>();
    }
    if (!self.node_to_id.contains(v_of_edge)) {
        v = DiGraph_add_one_node(self, v_of_edge);
    } else {
        v = self.node_to_id[v_of_edge].cast<node_t>();
    }
    py::list items = py::list(edge_attr.attr("items")());
    self.adj[u][v] = node_attr_dict_factory();
    self.pred[v][u] = edge_attr_dict_factory();
    for (int i = 0; i < len(items); i++) {
        py::tuple kv = items[i].cast<py::tuple>();
        py::object pkey = kv[0];
        std::string weight_key = weight_to_string(pkey);
        weight_t value = kv[1].cast<weight_t>();
        self.adj[u][v].insert(std::make_pair(weight_key, value));
        self.pred[v][u].insert(std::make_pair(weight_key, value));
    }
}

py::object DiGraph_add_edge(py::args args, py::kwargs kwargs) {
    DiGraph& self = args[0].cast<DiGraph&>();