## Uses of Class
graph.tasks.GraphTasksVertex

- Packages that use GraphTasksVertex
  Package | Description
  --- | ---
  graph.tasks |

- - ### Uses of GraphTasksVertex in graph.tasks

    Fields in graph.tasks declared as GraphTasksVertex
    Modifier and Type | Field and Description
    --- | ---
    `private GraphTasksVertex` | GraphTasksVertex.`predecessor` pro Dijkstrův algoritmus nejkratší cesty
    `private GraphTasksVertex` | DijkstraShortestPath.HeapElement.`v`

    Methods in graph.tasks that return GraphTasksVertex
    Modifier and Type | Method and Description
    --- | ---
    `private GraphTasksVertex` | DijkstraShortestPath.`getGraphTaskVertex()`
    `(package private) GraphTasksVertex` | GraphTasksVertex.`getPredecessor()`

    Methods in graph.tasks with parameters of type GraphTasksVertex
    Modifier and Type | Method and Description
    --- | ---
    `(package private) void` | GraphTasksVertex.`setPredecessor(GraphTasksVertex predecessor)`
    `Sequence` | DijkstraShortestPath.`shortestPath(GraphTasksVertex aStart, GraphTasksVertex aTarget)` Najde nejkratší cestu z výchozího do cílového vrcholu.
    `Sequence` | FloydShortestPath.`shortestPath(GraphTasksVertex aStart, GraphTasksVertex aTarget)` Hledání nejkratší cesty.
    `Sequence` | GraphTasks.`shortestPath(GraphTasksVertex aStart, GraphTasksVertex aTarget)` Hledání nejkratší cesty.
    `Sequence` | ShortestPath.`shortestPath(GraphTasksVertex aStart, GraphTasksVertex aTarget)` Hledání nejkratší cesty.
    `Sequence` | TestShortestPath.`shortestPath(GraphTasksVertex aStart, GraphTasksVertex aTarget)`