RenderDiGraph

Instance Constructors

new RenderDiGraph(diGraph: DiGraph[T], graphName: String = "", rankDir: String = "LR")

diGraph
The DiGraph to be rendered
graphName
Name of the graph, when shown in viewer
rankDir
Graph orientation, default is LR (left to right), most common alternative is TB (top to bottom)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def findOneLoop: Set[T]

This finds a loop in a DiGraph if one exists and returns nodes
This finds a loop in a DiGraph if one exists and returns nodes

Note
there is no way to currently to specify a particular loop
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def renderNode(node: T): String

override this to change the default way a node is displayed.
override this to change the default way a node is displayed. Default is toString surrounded by double quotes
```
val rend = new RenderDiGraph(graph, "alice") {
  override def renderNode(node: Symbol): String = s"\"${symbol.name}\""
  }
```
def showOnlyTheLoopAsDot: String

Searches a DiGraph for a cycle.
Searches a DiGraph for a cycle. The first one found will be rendered as a graph that contains only the nodes in the cycle plus the neighbors of those nodes.
returns
a string that can be used as input to the dot command, string is empty if no loop
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toDot: String

Convert this graph into input for the graphviz dot program
Convert this graph into input for the graphviz dot program
returns
A string representation of the digraph in dot notation
def toDotRanked: String

Convert this graph into input for the graphviz dot program.
Convert this graph into input for the graphviz dot program. It tries to align nodes in columns based on their minimum distance to a source. Can also be faster and better behaved on large graphs
returns
string that is a graphviz digraph
def toDotWithLoops(loopedNodes: Set[T], rankedNodes: ArrayBuffer[Seq[T]]): String

Convert this graph into input for the graphviz dot program, but with a loop,if present, highlighted in red.
Convert this graph into input for the graphviz dot program, but with a loop,if present, highlighted in red.
returns
string that is a graphviz digraph, but with loops highlighted
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package graph

class RenderDiGraph[T] extends AnyRef

Instance Constructors

new RenderDiGraph(diGraph: DiGraph[T], graphName: String = "", rankDir: String = "LR")

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def findOneLoop: Set[T]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def renderNode(node: T): String

def showOnlyTheLoopAsDot: String

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

def toDot: String

def toDotRanked: String

def toDotWithLoops(loopedNodes: Set[T], rankedNodes: ArrayBuffer[Seq[T]]): String

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped