Пример #1
0
    private List <Vertex> dijkstraPath(Vertex enemyV, Vertex playerV)
    {
        Algorithem    dijksta = new Algorithem();
        List <Vertex> temp    = m_Grid.Generate();
        List <Vertex> list    = dijksta.computePaths(temp, enemyV);

        return(dijksta.getShortestPath(playerV, list));
    }