UAS — Graph

#include <iostream>
using namespace std;

// Struct untuk Busur (Edge) berbentuk DLL
struct Edge {
    int targetNode;
    Edge *prev;
    Edge *next;
};

// Struct untuk Simpul (Vertex)
struct Vertex {
    int id;
    Edge *firstEdge; // Pointer awal ke daftar rutenya
};

// Array Penampung 8 Simpul
Vertex Graph[8];

void InitGraph() {
    for(int i = ; i < ; i++) {
        Graph[i].id = i;
        Graph[i].firstEdge = ;
    }
}


{
    Edge *NewEdge =  Edge;
    NewEdge->targetNode = dest;
    NewEdge->prev = ;
    NewEdge->next = ;

     (Graph[src].firstEdge == ) {
        Graph[src].firstEdge = NewEdge;
    }  {
        NewEdge->next = Graph[src].firstEdge;
        Graph[src].firstEdge->prev = NewEdge;
        Graph[src].firstEdge = NewEdge;
    }
}


{
    Edge *temp = Graph[src].firstEdge;
    
    
     (temp !=  && temp->targetNode != dest) {
        temp = temp->next;
    }
    
     (temp != ) { 
         (temp == Graph[src].firstEdge) { 
            Graph[src].firstEdge = temp->next;
             (Graph[src].firstEdge != ) 
                Graph[src].firstEdge->prev = ;
        }   (temp->next == ) { 
            temp->prev->next = ;
        }  { 
            temp->prev->next = temp->next;
            temp->next->prev = temp->prev;
        }
         temp;
    }
}

{
    ();
    
    
    
    (, );
    (, );
    
    (, );
    (, );
    
    (, );
    (, );
    
    cout <<  << endl;
     ;
}