animation

Type Members

1. case class AnimateCommand(action: CommandType.Value, eid: Int, shape: Shape, label: String, primary: Boolean, color: Color, pts: Array[Double], time: Double, from_eid: Int = 1, to_eid: Int = 1) extends Product with Serializable

   

   The AnimateCommand class provides a template for animation commands.

   The AnimateCommand class provides a template for animation commands.

   action

   the animation action to perform

   eid

   the external id for the component acted upon

   shape

   the shape of graph component (node, edge or token)

   label

   the display label for the component

   primary

   whether the component is primary (true) or secondary (false)

   color

   the color of the component

   pts

   the set points/dimensions giving the shapes location and size

   time

   simulation time when the command is to be performed

   from_eid

   the eid of the orgination node (only for edges)

   to_eid

   the eid of the destination node (only for edges)

2. class Animator extends Transform with Error

   

   The Animator class implements the commands to create, destroy, move and scale components (nodes, edges or tokens) in an animated graph.

3. class DgAnimator extends VizFrame with Runnable with Error

   

   The DgAnimator class is an animation engine for animating graphs.

   The DgAnimator class is an animation engine for animating graphs. For example, it can animate bipartite graphs to animate Petri Nets.

4. class Dgraph extends Error

   

   The Dgraph class is for defining graph structures suitable for animation.

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