scalation.animation

Dgraph

class Dgraph extends Error

This class is for defining graph structures suitable for animation. Graphs consist of nodes, edges and tokens. Tokens can be positioned within nodes or on edges. A graph animation class that uses this class would typically move the tokens by changing there location over time. This class supports both directed graphs and bipartite graphs. Directed graphs contain only primary nodes, while bipartite graphs have both primary and secondary nodes along with the rule that edges must go from primaries to secondaries or secondaries to primaries. Bipartite graphs can be used to represent Petri Nets by letting Transitions be primary nodes and Places be secondary nodes. Everything can be labeled (nodes, edges and tokens as well as the graph itself). Nodes and edges may be added to/removed from graphs, while tokens may be added to/removed from either nodes or edges. Tokens may also be free (not bound to nodes or edges).

Linear Supertypes
Error, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Dgraph
  2. Error
  3. AnyRef
  4. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Dgraph(name: String = "Dgraph", bipartite: Boolean = false)

Type Members

  1. case class Edge(shape: CurvilinearShape, label: String, primary: Boolean, color: Color, from: Node, to: Node, bend: Double) extends Product with Serializable

    This class is used to represent edges in the graph.

  2. case class Node(shape: RectangularShape, label: String, primary: Boolean, color: Color, x: Double, y: Double, w: Double, h: Double) extends Product with Serializable

    This class is used to represent nodes in the graph.

  3. case class Token(shape: RectangularShape, label: String, primary: Boolean, color: Color, onNode: Node, w: Double, h: Double) extends Product with Serializable

    This class is used to represent tokens in the graph.

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. def addEdge(e: Edge): Unit

    Add an edge to the graph.

    Add an edge to the graph.

    e

    the edge to add

  7. def addFreeToken(t: Token): Unit

    Add a free token to the graph.

    Add a free token to the graph.

    t

    the free token to add

  8. def addNode(n: Node): Unit

    Add a node to the graph.

    Add a node to the graph.

    n

    the node to add

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  10. def clone(): AnyRef

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

  11. val edges: ListBuffer[Edge]

    List of edges in the graph

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

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

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

  15. def flaw(method: String, message: String): Unit

    Show the flaw by printing the error message.

    Show the flaw by printing the error message.

    method

    the method where the error occurred

    message

    the error message

    Definition Classes
    Error

  16. val freeTokens: ListBuffer[Token]

    List of free tokens in the graph (bound tokens must be in a nodes or edges list)

  17. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  18. def getRoots: ListBuffer[Node]

    Get all the root nodes (those with no incoming edges).

  19. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  22. val nodes: ListBuffer[Node]

    List of nodes in the graph

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. def removeEdge(e: Edge): Unit

    Remove an edge from the graph.

    Remove an edge from the graph.

    e

    the edge to remove

  26. def removeFreeToken(t: Token): Unit

    Remove a free token from the graph.

    Remove a free token from the graph.

    t

    the free token to remove

  27. def removeNode(n: Node): Unit

    Remove a node from the graph.

    Remove a node from the graph.

    n

    the node to remove

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

    Definition Classes
    AnyRef

  29. def toString(): String

    Definition Classes
    AnyRef → Any

  30. def traverse(n: Node, level: Int): Unit

    Recursively visit all nodes in the graph.

    Recursively visit all nodes in the graph.

    n

    the current node

    level

    the recursion level

  31. def traverseNodes(): Unit

    Traverse the graph printing out its nodes and showing connectivity by indentation.

  32. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Error

Inherited from AnyRef

Inherited from Any