Adjacency Matrix to Adjacency List translation

Considering that for graph G = (V, E), the node class of the adjacency list has following representation.

class Node
{
Vertex element;
Node next;
}

Node [] Translate_AdjacencyMatrix_to_AdjacencyList (boolean [][] M, int n)
{
Node [] AdjList = new Node[n];

// Initialization of Adjacency List
for i = 1 to n do
AdjList[i] = null;

// Construction of Adjacency List from Adjacency Matrix
for i = 1 to n do
for j = n to 1 do
{
if (M[i][j] == true)
{
Node P = new Node;
P.next = AdjList[i];
P.element = j;
AdjList[i] = P;
}
}

return (AdjList);
}

Notice that it is small modification of algorithm to convert Adjacency List to Adjacency Matrix.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!