Follow along with the video below to see how to install our site as a web app on your home screen.
Anmerkung: This feature currently requires accessing the site using the built-in Safari browser.
A(0)=5,3
A(1)=5,3,2
A(2)=4,1
A(3)=1,6,4,0
A(4)=6,2,3
A(5)=1,0
A(6)=4,3
public static void main(String[] args) throws IOException, InterruptedException {
for(int i = 0; i < reihe; i++){
for(int n = 0; n < spalte; n++){
Flaeche[i][n]= false;
}
}
//Initalisierung des Arrays
public static final int reihe = 4;
public static final int spalte = 11;
bool matrix[][] = {
{1,0,0},
{0,0,1},
{0,1,1}
}
/* DG_ads_M.c: TZ, 11-11-2004
----------
Abstract data structure for directed graphs with
adjazenzmatrix.
====================================================*/
#include "WDG_ADS_M.h"
#define MAX_VERT 100 /* max number of vertices */
#include <stdio.h>
typedef enum bool {false, true} bool;
typedef bool AdjMatrix [MAX_VERT][MAX_VERT];
int n = 0; /* <= MAX_VERTICES, current number of vertices */
AdjMatrix m; /* matrix */
void AddEdge (int i, int j) {
if ( i != j )
if ((i-1 >= 0) && (j-1 >= 0) && (i-1 < n) && (j-1 < n))
m[i-1][j-1] = true;
} /* AddEdge */
void RemoveEdge (int i, int j) {
if ( i != j )
if ((i-1 >= 0) && (j-1 >= 0) && (i-1 < n) && (j-1 < n))
m[i-1][j-1] = false;
} /* RemoveEdge */
int ShortestPath (int vScr, int vDest) {
AdjMatrix temp;
int i, j, k;
/* init temp with m */
for ( i = 0; i < n; i++ ) {
for ( j = 0; j < n; j++)
temp[i][j]=m[i][j];
} /* for */
for ( i = 0; i < n; i++ )
for ( j = 0; j < n; j++ )
if (temp[j][i])
for ( k = 0; k < n; k++ )
if ( temp[k][j] > 0 )
if ( (temp[k][i]==0) || (temp[j][i]+temp[k][j] < temp[k][i]) )
temp[k][i] = temp[j][i] + temp[k][j];
return temp[vScr-1][vDest-1];
} /* ShortestPath */