org.allenai.nlpstack.parse.poly.core

DirectedGraph

Related Doc: package core

case class DirectedGraph(nodes: IndexedSeq[DirectedGraphNode], edgesByNode: IndexedSeq[Seq[DirectedGraphEdge]]) extends Product with Serializable

A directed graph.

The index of a node is its position in the nodes list (counting from 0).

nodes

the nodes of the directed graph

edgesByNode

each node's outgoing edges

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DirectedGraph
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DirectedGraph(nodes: IndexedSeq[DirectedGraphNode], edgesByNode: IndexedSeq[Seq[DirectedGraphEdge]])

    nodes

    the nodes of the directed graph

    edgesByNode

    each node's outgoing edges

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. val edges: Set[DirectedGraphEdge]

  7. val edgesByNode: IndexedSeq[Seq[DirectedGraphEdge]]

    each node's outgoing edges

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  10. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  11. def getOutgoingEdges(nodeIndex: Int): Seq[DirectedGraphEdge]

    Gets the outgoing edges for the specified node.

    Gets the outgoing edges for the specified node.

    nodeIndex

    the node of interest

    returns

    the outgoing edges for the specified node

  12. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  13. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  14. val nodes: IndexedSeq[DirectedGraphNode]

    the nodes of the directed graph

  15. final def notify(): Unit

    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  17. val sinks: Set[Int]

    The sinks of the graph (i.e.

    The sinks of the graph (i.e. nodes with no outgoing edges).

  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  19. def toPositionTree(rootNode: Int): PositionTree

    Converts this directed graph into a position tree.

    Converts this directed graph into a position tree.

    Note: this is a recursive function. It will throw an exception if the graph is cyclic.

    rootNode

    index corresponding to the node you want to be the root of the tree

    returns

    this graph, as a position tree

  20. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  21. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  22. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped