Directed edge adjacent linked list Storage

# Include <iostream>
# Include <cstring>
# Include <cstdio>
Using namespace STD;
Const int nmax= 1000;
Class edge {
Public:
Int V, NEX;
}; Edge e [Nmax];
Int N, K, head [Nmax]; // head [I] is the head of the linked list starting from vertex I.
Void addedge (int A, int B) {// an algorithm for adding an edge to a graph, note that the following node with directed edge/B as a is a ----> B
E [K]. V = B;
E [K]. NEX = head [a];
Head [a] = K;
K ++;
}
Int main (){
Int I, A, B, W, k = 1;
Scanf ("% d", & N );
Memset (Head, 0, sizeof (head ));
For (I = 0; I <n; I ++ ){
Scanf ("% d", & A, & B );
Addedge (a, B); // Add an edge directed by A to B
}
Cin> W; // output the point pointed to by W.
For (I = head [w]; I; I = E [I]. NEX ){
Cout <E [I]. v <Endl;
}
Cout <"End \ n ";
Return 0;
}