Function DiGraph_add_one_node

cpp_easygraph/classes/directed_graph.cpp:129–152

}

node_t DiGraph_add_one_node(DiGraph& self, py::object one_node_for_adding,
                            py::object node_attr = py::dict()) {
    node_t id;
    if (self.node_to_id.contains(one_node_for_adding)) {
        id = self.node_to_id[one_node_for_adding].cast<node_t>();
    } else {
        id = ++(self.id);
        self.id_to_node[py::cast(id)] = one_node_for_adding;
        self.node_to_id[one_node_for_adding] = id;
    }
    py::list items = py::list(node_attr.attr("items")());
    self.node[id] = node_attr_dict_factory();
    self.adj[id] = adj_attr_dict_factory();
    self.pred[id] = adj_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.node[id].insert(std::make_pair(weight_key, value));
    }
    return id;
}

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