W3Schools 線上編輯器 - W3Schools 教學

Python

Java

#include <stdio.h>

void printAdjacencyMatrix(int matrix[4][4], int size) {
    printf("Adjacency Matrix:\n");
    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            printf("%d ", matrix[i][j]);
        }
        printf("\n");
    }
}

void printConnections(int matrix[4][4], char vertices[4], int size) {
    printf("\nConnections for each vertex:\n");
    for (int i = 0; i < size; i++) {
        printf("%c: ", vertices[i]);
        for (int j = 0; j < size; j++) {
            if (matrix[i][j]) {  // if there is a connection
                printf("%c ", vertices[j]);
            }
        }
        printf("\n");
    }
}

int main() {
    char vertexData[4] = {'A', 'B', 'C', 'D'};
    int adjacencyMatrix[4][4] = {
        {0, 1, 1, 1}, // Edges for A
        {1, 0, 1, 0}, // Edges for B
        {1, 1, 0, 0}, // Edges for C
        {1, 0, 0, 0}  // Edges for D
    };

printAdjacencyMatrix(adjacencyMatrix, 4);
    printConnections(adjacencyMatrix, vertexData, 4);

return 0;
}

//C

public class Main {
    public static void main(String[] args) {

String[] vertexData = {"A", "B", "C", "D"};

int[][] adjacencyMatrix = {
            {0, 1, 1, 1}, // Edges for A
            {1, 0, 1, 0}, // Edges for B
            {1, 1, 0, 0}, // Edges for C
            {1, 0, 0, 0}  // Edges for D
        };

printAdjacencyMatrix(adjacencyMatrix);

printConnections(adjacencyMatrix, vertexData);
    }

public static void printAdjacencyMatrix(int[][] matrix) {
        System.out.println("Adjacency Matrix:");
        for (int[] row : matrix) {
            for (int value : row) {
                System.out.print(value + " ");
            }
            System.out.println();
        }
    }
    
    public static void printConnections(int[][] matrix, String[] vertices) {
        System.out.println("\nConnections for each vertex:");
        for (int i = 0; i < vertices.length; i++) {
            System.out.print(vertices[i] + ": ");
            for (int j = 0; j < vertices.length; j++) {
                if (matrix[i][j] == 1) { // if there is a connection
                    System.out.print(vertices[j] + " ");
                }
            }
            System.out.println();
        }
    }
}

//Java