Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    Prims

    Uploaded by

    23ucs649

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Prims

    Uploaded by

    23ucs649
    4 views3 pages

    Original Title

    prims

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    4 views3 pages

    Prims

    Uploaded by

    23ucs649

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    You are on page 1of 3

    #include <stdio.

    h>
    #include <stdlib.h>
    #include <limits.h>
    #include <time.h>
    #define MAX_VERTICES 150
    #define INF INT_MAX
    typedef struct {
    int vertex;
    int weight;
    } Edge;
    typedef struct Node {
    Edge edge;
    struct Node* left;
    struct Node* right;
    } Node;
    Node* createNode(Edge edge);
    void insert(Node** root, Edge edge);
    Edge extractMin(Node** root);
    int isEmpty(Node* root);
    void prim(int graph[MAX_VERTICES][MAX_VERTICES], int numVertices, int startVertex);
    void
    generateGraph(int graph[MAX_VERTICES][MAX_VERTICES], int numVertices, int
    numEdges); void
    freeHeap(Node* node);
    int main() {
    int numVertices, numEdges;
    printf("Enter the number of vertices: ");
    scanf("%d", &numVertices);
    printf("Enter the number of edges: ");
    scanf("%d", &numEdges);

    int graph[MAX_VERTICES][MAX_VERTICES] = {0};


    generateGraph(graph, numVertices, numEdges);
    printf("Generated Graph (Adjacency Matrix):\n");
    for (int i = 0; i < numVertices; i++) {
    for (int j = 0; j < numVertices; j++) {
    printf("%3d ", graph[i][j]);
    }
    printf("\n");
    }
    printf("\nRunning Prim's Algorithm...\n");
    clock_t start = clock();
    prim(graph, numVertices, 0);
    clock_t end = clock();
    double executionTime = (double)(end - start) / CLOCKS_PER_SEC;
    printf("Execution Time: %f seconds\n", executionTime);
    return 0;
    }
    Node* createNode(Edge edge) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->edge = edge;
    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
    }
    void insert(Node** root, Edge edge) {
    Node* newNode = createNode(edge);
    if (*root == NULL) {
    *root = newNode;
    return;
    }
    Node* current = *root;
    Node* parent = NULL;
    while (current) {
    parent = current;
    if (edge.weight < current->edge.weight) {
    current = current->left;
    } else {
    current = current->right;
    }
    }
    if (edge.weight < parent->edge.weight) {
    parent->left = newNode;
    } else {
    parent->right = newNode;
    }

    }
    Edge extractMin(Node** root) {
    if (isEmpty(*root)) {
    Edge nullEdge = {-1, -1};
    return nullEdge;
    }
    Node* minNode = *root;
    Edge minEdge = minNode->edge;
    if (minNode->left) {
    *root = minNode->left;
    Node* rightChild = minNode->right;
    Node* temp = *root;
    while (temp->right) {
    temp = temp->right;
    }
    temp->right = rightChild;
    } else {
    *root = minNode->right;
    }
    free(minNode);
    return minEdge;
    }
    int isEmpty(Node* root) {
    return root == NULL;
    }
    void prim(int graph[MAX_VERTICES][MAX_VERTICES], int numVertices, int startVertex)
    {
    int inMST[MAX_VERTICES] = {0};
    Node* root = NULL;
    Edge currentEdge;
    int totalWeight = 0;
    inMST[startVertex] = 1;
    for (int i = 0; i < numVertices; i++) {
    if (graph[startVertex][i] > 0) {
    Edge edge = {i, graph[startVertex][i]};
    insert(&root, edge);
    }
    }
    printf("Edges in the Minimum Spanning Tree:\n");
    while (!isEmpty(root)) {
    currentEdge = extractMin(&root);
    int nextVertex = currentEdge.vertex;
    if (inMST[nextVertex]) {
    continue;

    }
    printf("%d - %d (weight: %d)\n", startVertex, nextVertex,
    currentEdge.weight); totalWeight += currentEdge.weight;
    inMST[nextVertex] = 1;
    startVertex = nextVertex;
    for (int i = 0; i < numVertices; i++) {
    if (graph[nextVertex][i] > 0 && !inMST[i]) {
    Edge edge = {i, graph[nextVertex][i]};
    insert(&root, edge);
    }
    }
    }
    printf("Total weight of MST: %d\n", totalWeight);
    freeHeap(root);
    }
    void generateGraph(int graph[MAX_VERTICES][MAX_VERTICES], int numVertices, int
    numEdges) {
    srand(time(NULL));
    for (int i = 0; i < numEdges; i++) {
    int u = rand() % numVertices;
    int v = rand() % numVertices;
    int weight = rand() % 10 + 1;
    if (u != v && graph[u][v] == 0) {
    graph[u][v] = weight;
    graph[v][u] = weight;
    }
    }
    }
    void freeHeap(Node* node) {
    if (node) {
    freeHeap(node->left);
    freeHeap(node->right);
    free(node);
    }
    }

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy