W3Schools Tryit Editor

Python

Java

​x
 
class Graph:    def __init__(self, size):        self.adj_matrix = [[0] * size for _ in range(size)]        self.size = size        self.vertex_data = [''] * size  ​    def add_edge(self, u, v):        if 0 <= u < self.size and 0 <= v < self.size:            self.adj_matrix[u][v] = 1            self.adj_matrix[v][u] = 1​    def add_vertex_data(self, vertex, data):        if 0 <= vertex < self.size:            self.vertex_data[vertex] = data​    def print_graph(self):        print("Adjacency Matrix:")        for row in self.adj_matrix:            print(' '.join(map(str, row)))        print("\nVertex Data:")        for vertex, data in enumerate(self.vertex_data):            print(f"Vertex {vertex}: {data}")​g = Graph(4)g.add_vertex_data(0, 'A')g.add_vertex_data(1, 'B')g.add_vertex_data(2, 'C')g.add_vertex_data(3, 'D')g.add_edge(0, 1)  # A - Bg.add_edge(0, 2)  # A - Cg.add_edge(0, 3)  # A - Dg.add_edge(1, 2)  # B - C​g.print_graph()​#Python

#include <stdio.h>
#include <stdlib.h>

#define SIZE 4

typedef struct Graph {
    int adjMatrix[SIZE][SIZE];
    char vertexData[SIZE];
} Graph;

void initGraph(Graph *g) {
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < SIZE; j++) {
            g->adjMatrix[i][j] = 0;
        }
        g->vertexData[i] = 0;
    }
}

void addEdge(Graph *g, int u, int v) {
    if (u >= 0 && u < SIZE && v >= 0 && v < SIZE) {
        g->adjMatrix[u][v] = 1;
        g->adjMatrix[v][u] = 1;
    }
}

void addVertexData(Graph *g, int vertex, char data) {
    if (vertex >= 0 && vertex < SIZE) {
        g->vertexData[vertex] = data;
    }
}

void printGraph(Graph *g) {
    printf("Adjacency Matrix:\n");
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < SIZE; j++) {
            printf("%d ", g->adjMatrix[i][j]);
        }
        printf("\n");
    }
    printf("\nVertex Data:\n");
    for (int i = 0; i < SIZE; i++) {
        printf("Vertex %d: %c\n", i, g->vertexData[i]);
    }
}

int main() {
    Graph g;
    initGraph(&g);

addVertexData(&g, 0, 'A');
    addVertexData(&g, 1, 'B');
    addVertexData(&g, 2, 'C');
    addVertexData(&g, 3, 'D');
    addEdge(&g, 0, 1); // A - B
    addEdge(&g, 0, 2); // A - C
    addEdge(&g, 0, 3); // A - D
    addEdge(&g, 1, 2); // B - C

printGraph(&g);

return 0;
}

//C

xxxxxxxxxx
 
#include <stdio.h>#include <stdlib.h>​#define SIZE 4​typedef struct Graph {    int adjMatrix[SIZE][SIZE];    char vertexData[SIZE];} Graph;​void initGraph(Graph *g) {    for (int i = 0; i < SIZE; i++) {        for (int j = 0; j < SIZE; j++) {            g->adjMatrix[i][j] = 0;        }        g->vertexData[i] = 0;    }}​void addEdge(Graph *g, int u, int v) {    if (u >= 0 && u < SIZE && v >= 0 && v < SIZE) {        g->adjMatrix[u][v] = 1;        g->adjMatrix[v][u] = 1;    }}​void addVertexData(Graph *g, int vertex, char data) {    if (vertex >= 0 && vertex < SIZE) {        g->vertexData[vertex] = data;    }}​void printGraph(Graph *g) {    printf("Adjacency Matrix:\n");    for (int i = 0; i < SIZE; i++) {        for (int j = 0; j < SIZE; j++) {            printf("%d ", g->adjMatrix[i][j]);        }        printf("\n");    }    printf("\nVertex Data:\n");    for (int i = 0; i < SIZE; i++) {        printf("Vertex %d: %c\n", i, g->vertexData[i]);    }}

class Graph {
    private int[][] adjMatrix;
    private char[] vertexData;
    private int size;

public Graph(int size) {
        this.size = size;
        this.adjMatrix = new int[size][size];
        this.vertexData = new char[size];
    }

public void addEdge(int u, int v) {
        if (u >= 0 && u < size && v >= 0 && v < size) {
            adjMatrix[u][v] = 1;
            adjMatrix[v][u] = 1;
        }
    }

public void addVertexData(int vertex, char data) {
        if (vertex >= 0 && vertex < size) {
            vertexData[vertex] = data;
        }
    }

public void printGraph() {
        System.out.println("Adjacency Matrix:");
        for (int i = 0; i < size; i++) {
            for (int j = 0; j < size; j++) {
                System.out.print(adjMatrix[i][j] + " ");
            }
            System.out.println();
        }

System.out.println("\nVertex Data:");
        for (int i = 0; i < size; i++) {
            System.out.println("Vertex " + i + ": " + vertexData[i]);
        }
    }
}

public class Main {
    public static void main(String[] args) {
        Graph g = new Graph(4);
        g.addVertexData(0, 'A');
        g.addVertexData(1, 'B');
        g.addVertexData(2, 'C');
        g.addVertexData(3, 'D');
        g.addEdge(0, 1);  // A - B
        g.addEdge(0, 2);  // A - C
        g.addEdge(0, 3);  // A - D
        g.addEdge(1, 2);  // B - C

g.printGraph();
    }
}

//Java

xxxxxxxxxx
 
class Graph {    private int[][] adjMatrix;    private char[] vertexData;    private int size;​    public Graph(int size) {        this.size = size;        this.adjMatrix = new int[size][size];        this.vertexData = new char[size];    }​    public void addEdge(int u, int v) {        if (u >= 0 && u < size && v >= 0 && v < size) {            adjMatrix[u][v] = 1;            adjMatrix[v][u] = 1;        }    }​    public void addVertexData(int vertex, char data) {        if (vertex >= 0 && vertex < size) {            vertexData[vertex] = data;        }    }​    public void printGraph() {        System.out.println("Adjacency Matrix:");        for (int i = 0; i < size; i++) {            for (int j = 0; j < size; j++) {                System.out.print(adjMatrix[i][j] + " ");            }            System.out.println();        }​        System.out.println("\nVertex Data:");        for (int i = 0; i < size; i++) {            System.out.println("Vertex " + i + ": " + vertexData[i]);        }    }}​public class Main {    public static void main(String[] args) {        Graph g = new Graph(4);        g.addVertexData(0, 'A');        g.addVertexData(1, 'B');