Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- using System.Linq;
- using System.Text;
- using System.Threading.Tasks;
- namespace Lab4_Graph
- {
- class Program
- {
- static int[,] graph = new int[12, 14] {
- /*0*/ {1,1,0,0,0,0,0,0,0,0,0,0,0,0},
- {1,0,0,0,0,0,0,0,0,0,0,0,0,0},
- {0,0,1,1,1,0,0,0,0,0,0,0,0,0},
- {0,0,1,0,0,0,0,0,0,0,0,0,0,0},
- {0,0,0,0,0,1,1,0,0,0,0,0,0,0},
- {0,1,0,1,0,0,0,1,1,0,0,0,0,0},
- {0,0,0,0,0,0,0,1,0,1,1,0,0,0},
- {0,0,0,0,1,0,0,0,0,0,0,1,0,0},
- {0,0,0,0,0,1,0,0,0,0,0,0,1,0},
- {0,0,0,0,0,0,1,0,0,1,0,0,1,0},
- {0,0,0,0,0,0,0,0,1,0,0,0,0,1},
- {0,0,0,0,0,0,0,0,0,0,1,1,0,1 }
- };
- const int n = 12;
- const int m = 14;
- static bool[] used = new bool[n];
- static int j = 0;
- static int r = 0;
- static int i = 0;
- static int k = 0;
- static void Main(string[] args)
- {
- dfs(1);
- Console.ReadKey();
- }
- static void dfs(int t)
- {
- used[t] = true;
- int p;
- for (i = k; i < n; i++)
- {
- j = r;
- if ((graph[i, j] != 0) && (!used[i]))
- {
- used[i] = true;
- p = i;
- Console.Out.WriteLine(i);
- for (j = 0; j < m; j++)
- {
- i = p;
- if (graph[i, j] != 0)
- {
- r = j;
- for (k = 0; k < n; k++)
- {
- j = r;
- if ((graph[k, j] != 0) && (!used[k]))
- {
- dfs(i);
- }
- }
- }
- }
- }
- }
- }
- }
- }
- //
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement