Object

gov.nasa.jpl.imce.oml.resolver

GraphUtilities

Related Doc: package resolver

Permalink

object GraphUtilities

Hierarchical Topological Sort for directed hypergraphs where a node is a graph.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphUtilities
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def hierarchicalTopologicalSort[N, E[M] <: DiEdge[M]](queue: Seq[Graph[N, E]], result: Seq[N])(implicit arg0: ClassTag[N], nOrder: Ordering[N]): \/[Set[Throwable], Seq[N]]

    Permalink
    Attributes
    protected
    Annotations
    @tailrec()

  12. def hierarchicalTopologicalSort[N, E[M] <: DiEdge[M]](queue: Seq[Graph[N, E]])(implicit arg0: ClassTag[N], nOrder: Ordering[N]): \/[Set[Throwable], Seq[N]]

    Permalink

    Hierarchical Topological Sort of a Hypergraph.

    Hierarchical Topological Sort of a Hypergraph.

    N

    Type of graph nodes

    E

    Type of graph edges

    queue

    A collection of graphs, each of type Graph[N, E]

    nOrder

    Ordering among graph nodes of type N

    returns

    If successful, the topological sort of all the nodes of the graphs in queue.

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. def subGraphPrecedence[N, E[M] <: DiEdge[M]](g: Graph[N, E])(lt: Graph[N, E], gt: Graph[N, E])(implicit arg0: ClassTag[N], nOrder: Ordering[N]): Boolean

    Permalink
    Attributes
    protected

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

    Permalink
    Definition Classes
    AnyRef

  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped