depGraphs/es.weso.depgraphs/DepGraphJGraphT

DepGraphJGraphT

case class DepGraphJGraphT[Node]() extends DepGraph[Node] with LazyLogging
trait Serializable
trait Product
trait Equals
trait LazyLogging
trait DepGraph[Node]
class Object
trait Matchable
class Any

Type members

Classlikes

case class Edge(source: Node, posNeg: PosNeg, target: Node)

Types

type ES[A] = Either[String, A]

Value members

Concrete methods

override def addEdge(node1: Node, posNeg: PosNeg, node2: Node): DepGraph[Node]
Definition Classes
override def addNode(n: Node): DepGraph[Node]
Definition Classes
override def edgeBetween(node1: Node, node2: Node): Option[PosNeg]
Definition Classes
override def empty: DepGraph[Node]
Definition Classes
override def inEdges(node: Node): Either[String, Set[(Node, PosNeg)]]
Definition Classes
override def isomorphicWith(other: DepGraph[Node]): Either[String, Unit]
Definition Classes
override def negCycles: Set[Set[(Node, Node)]]
Definition Classes
override def nodes: Set[Node]
Definition Classes
override def outEdges(node: Node): Either[String, Set[(PosNeg, Node)]]
Definition Classes
def showEdges(showNode: Node => String): String

Inherited methods

def addNegEdge(node1: Node, node2: Node): DepGraph[Node]
Inherited from:
DepGraph
def addPosEdge(node1: Node, node2: Node): DepGraph[Node]
Inherited from:
DepGraph
def containsNegCycle: Boolean
Inherited from:
DepGraph
def oddNegCycles: Set[Set[(Node, Node)]]
Inherited from:
DepGraph
def productIterator: Iterator[Any]
Inherited from:
Product

Concrete fields

val graph: Graph[Node, Edge]

Inherited fields

lazy protected val logger: Logger
Inherited from:
LazyLogging