adjmatrix.cpp

#include <iostream>
using namespace std;

class Graph {
    int **adjMatrix;
    int vertices;

public:
    void createGraph(int v, int e) {
        if (v <= 0) {
            cout << "Number of vertices must be positive.\n";
            return;
        }

        vertices = v;
        adjMatrix = new int*[vertices];
        for (int i = 0; i < vertices; i++) {
            adjMatrix[i] = new int[vertices];
            for (int j = 0; j < vertices; j++) {
                adjMatrix[i][j] = 0;
            }
        }

        int u, ver;
        for (int i = 0; i < e; i++) {
            cout << "Enter edge " << i + 1 << " (format: u v): ";
            cin >> u >> ver;

            // Check for valid input
            if (u < 0 || u >= vertices || ver < 0 || ver >= vertices) {
                cout << "Invalid edge! Vertex numbers should be between 0 and " << vertices - 1 << ".\n";
                i--; // Repeat this iteration
                continue;
            }

            adjMatrix[u][ver] = 1;
            adjMatrix[ver][u] = 1; // Remove for directed graph
        }
    }

    void displayGraph() {
        if (vertices <= 0) return; // No graph to display

        cout << "Adjacency Matrix:\n";
        for (int i = 0; i < vertices; i++) {
            for (int j = 0; j < vertices; j++) {
                cout << adjMatrix[i][j] << " ";
            }
            cout << endl;
        }
    }

    void deleteGraph() {
        if (vertices <= 0) return; // No need to delete

        for (int i = 0; i < vertices; i++) {
            delete[] adjMatrix[i];
        }
        delete[] adjMatrix;
    }
};

int main() {
    Graph g;
    int v, e;
    cout << "Enter number of vertices: ";
    cin >> v;
    cout << "Enter number of edges: ";
    cin >> e;

    g.createGraph(v, e);
    g.displayGraph();
    g.deleteGraph();

    return 0;
}