public List <int> GetPath()
        {
            var visited = new List <int>()
            {
                0
            };
            var distances = new PathPoint[graph.vertexes.Count];

            distances[0] = new PathPoint(0, null, 0)
            {
                isLocked = true
            };
            for (int i = 1; i < graph.vertexes.Count; i++)
            {
                distances[i] = new PathPoint(int.MaxValue, null, i);
            }

            int currentId = 0;

            while (currentId != graph.vertexes.Count - 1)
            {
                var connectedIds = GetConnected(graph.connections, currentId);
                for (int i = 0; i < connectedIds.Length; i++)
                {
                    if (!visited.Contains(connectedIds[i]))
                    {
                        visited.Add(connectedIds[i]);
                        int newPathLength = graph.connections[currentId, connectedIds[i]] + distances[currentId].pathLength;
                        if (newPathLength < distances[connectedIds[i]].pathLength)
                        {
                            distances[connectedIds[i]].pathLength = newPathLength;
                            distances[connectedIds[i]].idFrom     = currentId;
                        }
                    }
                }
                var minUnlocked = distances.Where(p => !p.isLocked).Min();
                distances[minUnlocked.id].isLocked = true;
                currentId = minUnlocked.id;
            }

            var path = new List <int>();

            currentId = distances.Last().id;
            while (currentId != 0)
            {
                path.Insert(0, currentId);

                currentId = distances[currentId].idFrom.Value;
            }
            path.Insert(0, 0);

            return(path);
        }