cpw.mods.fml.common.toposort

## Class TopologicalSort.DirectedGraph<T>

- java.lang.Object
- - cpw.mods.fml.common.toposort.TopologicalSort.DirectedGraph<T>

- All Implemented Interfaces:
    Iterable<T>
  Enclosing class:
    TopologicalSort

      public static class TopologicalSort.DirectedGraph<T>
      extends Object
      implements Iterable<T>

- - ### Constructor Summary

    Constructors
    Constructor and Description
    `TopologicalSort.DirectedGraph()`

  - ### Method Summary

    Methods
    Modifier and Type | Method and Description
    --- | ---
    `void` | `addEdge(T from, T to)`
    `boolean` | `addNode(T node)`
    `boolean` | `edgeExists(T from, T to)`
    `Set<T>` | `edgesFrom(T from)`
    `boolean` | `isEmpty()`
    `Iterator<T>` | `iterator()`
    `void` | `removeEdge(T from, T to)`
    `int` | `size()`
    `String` | `toString()`

    - ### Methods inherited from class java.lang.Object

      `equals, getClass, hashCode, notify, notifyAll, wait, wait, wait`

- - ### Constructor Detail

    - #### TopologicalSort.DirectedGraph

          public TopologicalSort.DirectedGraph()

  - ### Method Detail

    - #### addNode

          public boolean addNode(T node)

    - #### addEdge

          public void addEdge(T from,
                     T to)

    - #### removeEdge

          public void removeEdge(T from,
                        T to)

    - #### edgeExists

          public boolean edgeExists(T from,
                           T to)

    - #### edgesFrom

          public Set<T> edgesFrom(T from)

    - #### iterator

          public Iterator<T> iterator()

      Specified by:
        `iterator` in interface `Iterable<T>`

    - #### size

          public int size()

    - #### isEmpty

          public boolean isEmpty()

    - #### toString

          public String toString()

      Overrides:
        `toString` in class `Object`