Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void DFS(int bezugsKnoten, Graph graph) /* DFS beginnend bei bezugsKnoten */
- {
- int aktNachbarn[MAX_ELEMENTE] = {0};
- int aktAnzNachbarn, aktNachbarIndex;
- int aktNachbarKnoten;
- /* TODO: Ihre Implementierung zur Aufgabe 9.N.b */
- int j;
- process(bezugsKnoten);
- visited[bezugsKnoten] = 1;
- for (j = 0; j < MAX_ELEMENTE; j++) {
- if(!visited[j]&&graph.adjMatrix[bezugsKnoten][j]==1) {
- DFS(j, graph);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement