1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
using System;
using System.Collections.Generic;
namespace hiho
{
    class _119
    {
        private static int TotalSize = 0;
        private static int[,] rGraph = null;
        private static bool HashPath(int[] path)
        {
            Queue<int> q = new Queue<int>();
            q.Enqueue(0);
            bool[] visited = new bool[TotalSize];
            while (q.Count > 0)
            {
                int node = q.Dequeue();
                for (int i = 0; i < TotalSize; ++i)
                {
                    if (!visited[i] && rGraph[node, i] > 0)
                    {
                        q.Enqueue(i);
                        visited[i] = true;
                        path[i] = node;
                    }
                }
            }
            return visited[TotalSize - 1];
        }
        public static void Main()
        {
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX