Dgraph

The Dgraph 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

Instance Constructors

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

Type Members

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.
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.
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

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def addEdge(e: Edge): Unit

Add an edge to the graph.
Add an edge to the graph.
e
the edge to add
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
def addNode(n: Node): Unit

Add a node to the graph.
Add a node to the graph.
n
the node to add
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val edges: ListBuffer[Edge]

List of edges in the graph
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
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
val freeTokens: ListBuffer[Token]

List of free tokens in the graph (bound tokens must be in a nodes or edges list)
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getRoots: ListBuffer[Node]

Get all the root nodes (those with no incoming edges).
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val nodes: ListBuffer[Node]

List of nodes in the graph
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def removeEdge(e: Edge): Unit

Remove an edge from the graph.
Remove an edge from the graph.
e
the edge to remove
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
def removeNode(n: Node): Unit

Remove a node from the graph.
Remove a node from the graph.
n
the node to remove
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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
def traverseNodes(): Unit

Traverse the graph printing out its nodes and showing connectivity by indentation.
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

class Dgraph extends Error

Instance Constructors

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

Type Members

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

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

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

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addEdge(e: Edge): Unit

def addFreeToken(t: Token): Unit

def addNode(n: Node): Unit

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val edges: ListBuffer[Edge]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

val freeTokens: ListBuffer[Token]

final def getClass(): Class[_]

def getRoots: ListBuffer[Node]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

val nodes: ListBuffer[Node]

final def notify(): Unit

final def notifyAll(): Unit

def removeEdge(e: Edge): Unit

def removeFreeToken(t: Token): Unit

def removeNode(n: Node): Unit

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

def toString(): String

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

def traverseNodes(): Unit

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Error

Inherited from AnyRef

Inherited from Any

Ungrouped