Backend for Adjacency List Graph added

Author: Prerak Singh

_graph.cp

@@ -9,6 +9,7 @@
 from . import algorithms
 from . import adjacency_list
 from . import adjacency_matrix
+from . import _extensions
 
 from .algorithms import (
     breadth_first_search,

_graph.cpp

@@ -0,0 +1,355 @@
+#ifndef ADJACENCY_LIST_GRAPH_HPP
+#define ADJACENCY_LIST_GRAPH_HPP
+
+#define PY_SSIZE_T_CLEAN
+#include <Python.h>
+#include <vector>
+#include <unordered_map>
+#include <string>
+#include "AdjacencyListGraphNode.hpp"
+#include "GraphEdge.hpp"
+
+extern PyTypeObject AdjacencyListGraphType;
+
+typedef struct {
+
+    PyObject_HEAD
+    std::vector<AdjacencyListGraphNode *> nodes;
+    std::unordered_map<std::string, GraphEdge*> edges;
+    std::unordered_map<std::string, AdjacencyListGraphNode*> node_map;
+
+} AdjacencyListGraph;
+
+static void AdjacencyListGraph_dealloc(AdjacencyListGraph* self) {
+    for (AdjacencyListGraphNode* node : self->nodes) {
+        Py_XDECREF(node);
+    }
+    self->nodes.clear();
+
+    for (auto& pair : self->edges) {
+        Py_XDECREF(pair.second);
+    }
+    self->edges.clear();
+
+    self->node_map.clear();
+
+    Py_TYPE(self)->tp_free(reinterpret_cast<PyObject*>(self));
+}
+
+static PyObject* AdjacencyListGraph_new(PyTypeObject* type, PyObject* args, PyObject* kwds) {
+    AdjacencyListGraph* self = (AdjacencyListGraph*)type->tp_alloc(type, 0);
+    if (!self)
+        return NULL;
+
+    new (&self->nodes) std::vector<AdjacencyListGraphNode*>();
+    new (&self->edges) std::unordered_map<std::string, GraphEdge*>();
+    new (&self->node_map) std::unordered_map<std::string, AdjacencyListGraphNode*>();
+
+    Py_ssize_t num_args = PyTuple_Size(args);
+    for (Py_ssize_t i = 0; i < num_args; ++i) {
+        PyObject* node_obj = PyTuple_GetItem(args, i);
+        if (!PyObject_IsInstance(node_obj, (PyObject*)&AdjacencyListGraphNodeType)) {
+            PyErr_SetString(PyExc_TypeError, "All arguments must be AdjacencyListGraphNode instances");
+
+            self->nodes.~vector();
+            self->edges.~unordered_map();
+            self->node_map.~unordered_map();
+            Py_TYPE(self)->tp_free((PyObject*)self);
+            return NULL;
+        }
+
+        AdjacencyListGraphNode* node = (AdjacencyListGraphNode*)node_obj;
+
+        if (self->node_map.find(node->name) != self->node_map.end()) {
+            PyErr_Format(PyExc_ValueError, "Duplicate node with name '%s'", node->name.c_str());
+
+            self->nodes.~vector();
+            self->edges.~unordered_map();
+            self->node_map.~unordered_map();
+            Py_TYPE(self)->tp_free((PyObject*)self);
+            return NULL;
+        }
+
+        Py_INCREF(node);
+        self->nodes.push_back(node);
+        self->node_map[node->name] = node;
+    }
+    return (PyObject*)self;
+}
+
+static std::string make_edge_key(const std::string& source, const std::string& target) {
+    return source + "_" + target;
+}
+
+static PyObject* AdjacencyListGraph_add_vertex(AdjacencyListGraph* self, PyObject* args) {
+    PyObject* node_obj;
+
+    if (!PyArg_ParseTuple(args, "O", &node_obj)) {
+        PyErr_SetString(PyExc_ValueError, "Expected a single AdjacencyListGraphNode object");
+        return NULL;
+    }
+
+    if (!PyObject_IsInstance(node_obj, (PyObject*)&AdjacencyListGraphNodeType)) {
+        PyErr_SetString(PyExc_TypeError, "Object is not an AdjacencyListGraphNode");
+        return NULL;
+    }
+
+    AdjacencyListGraphNode* node = (AdjacencyListGraphNode*)node_obj;
+
+    if (self->node_map.find(node->name) != self->node_map.end()) {
+        PyErr_SetString(PyExc_ValueError, "Node with this name already exists");
+        return NULL;
+    }
+
+    Py_INCREF(node);
+    self->nodes.push_back(node);
+    self->node_map[node->name] = node;
+
+    Py_RETURN_NONE;
+}
+
+
+static PyObject* AdjacencyListGraph_is_adjacent(AdjacencyListGraph* self, PyObject* args) {
+    const char* node1_name_c;
+    const char* node2_name_c;
+    if (!PyArg_ParseTuple(args, "ss", &node1_name_c, &node2_name_c))
+        return NULL;
+
+    std::string node1_name(node1_name_c);
+    std::string node2_name(node2_name_c);
+
+    auto it1 = self->node_map.find(node1_name);
+    if (it1 == self->node_map.end()) {
+        PyErr_SetString(PyExc_KeyError, "node1 not found");
+        return NULL;
+    }
+    AdjacencyListGraphNode* node1 = it1->second;
+
+    if (node1->adjacent.find(node2_name) != node1->adjacent.end()) {
+        Py_RETURN_TRUE;
+    } else {
+        Py_RETURN_FALSE;
+    }
+}
+
+static PyObject* AdjacencyListGraph_num_vertices(AdjacencyListGraph* self, PyObject* Py_UNUSED(ignored)) {
+    return PyLong_FromSize_t(self->nodes.size());
+}
+
+static PyObject* AdjacencyListGraph_num_edges(AdjacencyListGraph* self, PyObject* Py_UNUSED(ignored)) {
+    return PyLong_FromSize_t(self->edges.size());
+}
+
+static PyObject* AdjacencyListGraph_neighbors(AdjacencyListGraph* self, PyObject* args) {
+    const char* node_name_c;
+    if (!PyArg_ParseTuple(args, "s", &node_name_c))
+        return NULL;
+
+    std::string node_name(node_name_c);
+    auto it = self->node_map.find(node_name);
+    if (it == self->node_map.end()) {
+        PyErr_SetString(PyExc_KeyError, "Node not found");
+        return NULL;
+    }
+    AdjacencyListGraphNode* node = it->second;
+
+    PyObject* neighbors_list = PyList_New(0);
+    if (!neighbors_list) return NULL;
+
+    for (const auto& adj_pair : node->adjacent) {
+        Py_INCREF(adj_pair.second);
+        PyList_Append(neighbors_list, (PyObject*)adj_pair.second);
+    }
+
+    return neighbors_list;
+}
+
+static PyObject* AdjacencyListGraph_remove_vertex(AdjacencyListGraph* self, PyObject* args) {
+    const char* name_c;
+    if (!PyArg_ParseTuple(args, "s", &name_c))
+        return NULL;
+
+    std::string name(name_c);
+    auto it = self->node_map.find(name);
+    if (it == self->node_map.end()) {
+        PyErr_SetString(PyExc_KeyError, "Node not found");
+        return NULL;
+    }
+
+    AdjacencyListGraphNode* node_to_remove = it->second;
+
+    auto& nodes_vec = self->nodes;
+    nodes_vec.erase(std::remove(nodes_vec.begin(), nodes_vec.end(), node_to_remove), nodes_vec.end());
+
+    self->node_map.erase(it);
+
+    Py_XDECREF(node_to_remove);
+
+    for (auto& node_pair : self->node_map) {
+        AdjacencyListGraphNode* node = node_pair.second;
+        auto adj_it = node->adjacent.find(name);
+        if (adj_it != node->adjacent.end()) {
+            Py_XDECREF(adj_it->second);
+            node->adjacent.erase(adj_it);
+        }
+    }
+
+    for (auto it = self->edges.begin(); it != self->edges.end(); ) {
+        const std::string& key = it->first;
+
+        bool involves_node = false;
+        size_t underscore = key.find('_');
+        if (underscore != std::string::npos) {
+            std::string source = key.substr(0, underscore);
+            std::string target = key.substr(underscore + 1);
+            if (source == name || target == name)
+                involves_node = true;
+        }
+
+        if (involves_node) {
+            Py_XDECREF(it->second);
+            it = self->edges.erase(it);
+        } else {
+            ++it;
+        }
+    }
+
+    Py_RETURN_NONE;
+}
+
+
+static PyObject* AdjacencyListGraph_get_edge(AdjacencyListGraph* self, PyObject* args) {
+    const char* source_c;
+    const char* target_c;
+    if (!PyArg_ParseTuple(args, "ss", &source_c, &target_c))
+        return NULL;
+
+    std::string key = make_edge_key(source_c, target_c);
+    auto it = self->edges.find(key);
+    if (it != self->edges.end()) {
+        Py_INCREF(it->second);
+        return (PyObject*)it->second;
+    }
+
+    Py_RETURN_NONE;
+}
+
+static PyObject* AdjacencyListGraph_remove_edge(AdjacencyListGraph* self, PyObject* args) {
+    const char* source_c;
+    const char* target_c;
+    if (!PyArg_ParseTuple(args, "ss", &source_c, &target_c))
+        return NULL;
+
+    std::string source(source_c);
+    std::string target(target_c);
+
+    auto it_source = self->node_map.find(source);
+    auto it_target = self->node_map.find(target);
+    if (it_source == self->node_map.end() || it_target == self->node_map.end()) {
+        PyErr_SetString(PyExc_KeyError, "Source or target node not found");
+        return NULL;
+    }
+
+    AdjacencyListGraphNode* source_node = it_source->second;
+
+    auto adj_it = source_node->adjacent.find(target);
+    if (adj_it != source_node->adjacent.end()) {
+        Py_XDECREF(adj_it->second);
+        source_node->adjacent.erase(adj_it);
+    }
+
+    std::string key = make_edge_key(source, target);
+    auto edge_it = self->edges.find(key);
+    if (edge_it != self->edges.end()) {
+        Py_XDECREF(edge_it->second);
+        self->edges.erase(edge_it);
+    }
+
+    Py_RETURN_NONE;
+}
+
+static PyObject* AdjacencyListGraph_add_edge(AdjacencyListGraph* self, PyObject* args) {
+    const char* source_cstr;
+    const char* target_cstr;
+    PyObject* value = Py_None;
+
+    if (!PyArg_ParseTuple(args, "ss|O", &source_cstr, &target_cstr, &value)) {
+        PyErr_SetString(PyExc_ValueError, "Expected source (str), target (str), and optional weight");
+        return NULL;
+    }
+
+    std::string source(source_cstr);
+    std::string target(target_cstr);
+
+    if (self->node_map.find(source) == self->node_map.end()) {
+        PyErr_SetString(PyExc_ValueError, "Source node does not exist");
+        return NULL;
+    }
+    if (self->node_map.find(target) == self->node_map.end()) {
+        PyErr_SetString(PyExc_ValueError, "Target node does not exist");
+        return NULL;
+    }
+
+    AdjacencyListGraphNode* source_node = self->node_map[source];
+    AdjacencyListGraphNode* target_node = self->node_map[target];
+
+    PyObject* edge_args = PyTuple_Pack(3, (PyObject*)source_node, (PyObject*)target_node, value);
+    if (!edge_args) return NULL;
+
+    PyObject* edge_obj = PyObject_CallObject((PyObject*)&GraphEdgeType, edge_args);
+    Py_DECREF(edge_args);
+
+    if (!edge_obj)
+        return NULL;
+
+    std::string key = make_edge_key(source, target);
+
+    auto it = self->edges.find(key);
+    if (it != self->edges.end()) {
+        Py_XDECREF(it->second);
+        it->second = (GraphEdge*)edge_obj;
+    } else {
+        self->edges[key] = (GraphEdge*)edge_obj;
+    }
+
+    auto adj_it = source_node->adjacent.find(target);
+    if (adj_it == source_node->adjacent.end()) {
+        Py_INCREF(target_node);
+        source_node->adjacent[target] = (PyObject*)target_node;
+    }
+
+    Py_RETURN_NONE;
+}
+
+
+
+
+static PyMethodDef AdjacencyListGraph_methods[] = {
+    {"add_vertex", (PyCFunction)AdjacencyListGraph_add_vertex, METH_VARARGS, "Add a vertex to the graph"},
+    {"add_edge", (PyCFunction)AdjacencyListGraph_add_edge, METH_VARARGS, "Add an edge to the graph"},
+    {"is_adjacent", (PyCFunction)AdjacencyListGraph_is_adjacent, METH_VARARGS, "Check adjacency between two nodes"},
+    {"num_vertices", (PyCFunction)AdjacencyListGraph_num_vertices, METH_NOARGS, "Number of vertices"},
+    {"num_edges", (PyCFunction)AdjacencyListGraph_num_edges, METH_NOARGS, "Number of edges"},
+    {"neighbors", (PyCFunction)AdjacencyListGraph_neighbors, METH_VARARGS, "Get neighbors of a node"},
+    {"remove_vertex", (PyCFunction)AdjacencyListGraph_remove_vertex, METH_VARARGS, "Remove a vertex"},
+    {"get_edge", (PyCFunction)AdjacencyListGraph_get_edge, METH_VARARGS, "Get edge between source and target"},
+    {"remove_edge", (PyCFunction)AdjacencyListGraph_remove_edge, METH_VARARGS, "Remove edge between source and target"},
+    {NULL}
+};
+
+
+PyTypeObject AdjacencyListGraphType = {
+    PyVarObject_HEAD_INIT(NULL, 0)
+    .tp_init= 0,
+    .tp_name = "_graph.AdjacencyListGraph",
+    .tp_basicsize = sizeof(AdjacencyListGraph),
+    .tp_itemsize = 0,
+    .tp_dealloc = (destructor)AdjacencyListGraph_dealloc,
+    .tp_flags = Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE,
+    .tp_doc = "Adjacency List Graph data structure",
+    .tp_methods = AdjacencyListGraph_methods,
+    .tp_new = AdjacencyListGraph_new,
+};
+
+#endif
+