using System; using System.Collections.Generic; namespace ConsoleApp { class Program { //try with a computer,may not work in android /* Graph implementation in an array:each number in the array shows the * way to the next node.for example, imaging that A,B,C,D,E are cities * and the numbers are road numbers.The cities are nodes and the roads * are edges. * * 🅰 * \ * \2 * \ * ↘ 4 * 🅱 --------→🅲 * | ↘ 6 * | 🅳 * 5 | ↗ * | /8 * ↓ 9 / * 🅵 --------→🅴 * * A = 0, B = 1, C = 2, D = 3, E = 4, F = 5 * The goal is to reach D from A: 2>4>6 or 2>5>9>8 * This program findest the first way in a graph from A to D which is 2 ,4 ,6 */ const int N = 6; const int M = 6; static void Main(string[] args) { int[,] arr = new int[N, M];//Declares the graph UpdateMatrix(arr);//updates data about the graph ShowMatrix(arr);//shows graph List l = ShowWayTo4(arr);//list that shows first way to D Console.WriteLine(); Console.Write(l.ToArray()[0]); for (int i = 1; i < l.Count; i++) { Console.Write("--->" + l.ToArray()[i]); } Console.WriteLine(); } static void UpdateMatrix(int[,] arr) { int n = arr.GetLength(0); int m = arr.GetLength(1); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { arr[i, j] = 0; } } arr[0, 1] = 2; arr[1, 2] = 4; arr[1, 5] = 5; arr[2, 3] = 6; arr[4, 3] = 8; arr[5, 4] = 9; } static void ShowMatrix(int[,] arr) { Console.Write(" "); for (int i = 0; i < N; i++) { Console.Write(i + " "); } Console.WriteLine("\n ________________"); for (int i = 0; i < N; i++) { Console.Write(i + " | "); for (int j = 0; j < M; j++) { Console.Write(arr[i, j] + " "); } Console.WriteLine(); } } static List ShowWayTo4(int[,] arr) // 2 4 6, 2 5 9 8 { List list = new List(); int p = 0; while (p != 3) // if we reached D which is 3, we dont need to continue { for (int j = 0; j < M; j++) { if(arr[p,j] != 0) { list.Add(arr[p, j]); p = j; break; } } } return list; } } }

Array Graph Path Finding