## Uses of Interface
graph.graphinterface.Graph

- Packages that use Graph
  Package | Description
  --- | ---
  graph.adjacencyarraygraph |
  graph.followerarraygraph |
  graph.graphinterface |
  graph.tasks |

- - ### Uses of Graph in graph.adjacencyarraygraph

    Classes in graph.adjacencyarraygraph that implement Graph
    Modifier and Type | Class and Description
    --- | ---
    `(package private) class` | `AdjacencyArrayDirectedGraph` Implementace grafu.
    `(package private) class` | `AdjacencyArrayGraph` Implementace grafu.
    `(package private) class` | `AdjacencyArrayUndirectedGraph` Implementace grafu.

  - ### Uses of Graph in graph.followerarraygraph

    Classes in graph.followerarraygraph that implement Graph
    Modifier and Type | Class and Description
    --- | ---
    `(package private) class` | `FollowerArrayDirectedGraph`
    `(package private) class` | `FollowerArrayGraph` Implementace grafu.
    `(package private) class` | `FollowerArrayUndirectedGraph` Implementace grafu.

  - ### Uses of Graph in graph.graphinterface

    Subinterfaces of Graph in graph.graphinterface
    Modifier and Type | Interface and Description
    --- | ---
    `interface` | `DirectedGraph` Specifikace orientovaného grafu.
    `interface` | `UndirectedGraph` Specifikace neorientovaného grafu.

  - ### Uses of Graph in graph.tasks

    Fields in graph.tasks declared as Graph
    Modifier and Type | Field and Description
    --- | ---
    `private Graph` | DijkstraShortestPath.`graph` graf, ve kterém se má hledat nejkratší cesta
    `private Graph` | FloydShortestPath.`graph` graf, ve kterém se má hledat nejkratší cesta
    `protected Graph` | GraphTasks.`graph` graf, na kterém se mají řešit úlohy
    `private Graph` | GraphWrapper.`graph` zapouzdřený graf
    `private Graph` | TestShortestPath.`graph`

    Methods in graph.tasks that return Graph
    Modifier and Type | Method and Description
    --- | ---
    `Graph` | GraphWrapper.`getGraph()`

    Methods in graph.tasks with parameters of type Graph
    Modifier and Type | Method and Description
    --- | ---
    `ShortestPath` | DijkstraShortestPathFactory.`createShortestPath(Graph aGraph, SequenceFactory aSeqFac)` Vyrobí objekt na hledání nejkratších cest.
    `ShortestPath` | FloydShortestPathFactory.`createShortestPath(Graph aGraph, SequenceFactory aSeqFac)` Vyrobí objekt na hledání nejkratších cest.
    `ShortestPath` | ShortestPathFactory.`createShortestPath(Graph aGraph, SequenceFactory aSeqFac)` Vyrobí objekt na hledání nejkratších cest.
    `ShortestPath` | TestShortestPathFactory.`createShortestPath(Graph aGraph, SequenceFactory aSeqFac)`
    `void` | GraphWrapper.`SetGraph(Graph graph)`

    Constructors in graph.tasks with parameters of type Graph
    Constructor and Description
    `DijkstraShortestPath(Graph aGraph, SequenceFactory aSeqFac, JustifiableHeapFactory aHeapFac)` Vyrobí objekt třídy DijkstraShortestPath.
    `FloydShortestPath(Graph aGraph, SequenceFactory aSeqFac)` Vyrobí objekt třídy FloydShortestPath.
    `GraphTasks(Graph aGraph, ShortestPathFactory spf, HeapFactory hf, SequenceFactory sf)` Vyrobí objekt na řešení grafových úloh.
    `HeapElement(Graph aGraph, GraphLatch aLatch)`
    `TestShortestPath(Graph aGraph, SequenceFactory aSeqFac)`