AuK/Durchläufe durch Graphen SS12

Wiki-Quelltext dieser Seite.

<language>Java</language>
<code id="4f8d7f1b996b0">
final int MAX_VERTS = 10;
int[][] adjMat;
adjMat = new int[MAX_VERTS][MAX_VERTS];

for(int y=0; y<MAX_VERTS;y++)
   for(int x=0; x<MAX_VERTS;x++)
      adjMat[x][y] = 0;

void addEdge(int start, int end)
{
   adjMat[start][end] = 1;
   adjMat[end][start] = 1;
}

</code>



<run id="4f8d7f1b99713">
addEdge(0,0);
addEdge(1,1);
addEdge(2,2);
addEdge(3,3);
addEdge(4,4);
addEdge(5,5);


for (int k = 0; k < MAX_VERTS; ++k) {
     for (int l = 0; l < MAX_VERTS; ++l) {
        System.out.print(adjMat[k][l] + "\t");}
System.out.println("");}
</run>