case class DepGraphJGraphT[Node]() extends DepGraph[Node] with LazyLogging with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- DepGraphJGraphT
- Serializable
- Product
- Equals
- LazyLogging
- DepGraph
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new DepGraphJGraphT()
Type Members
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
- def addEdge(node1: Node, posNeg: PosNeg, node2: Node): DepGraph[Node]
- Definition Classes
- DepGraphJGraphT → DepGraph
- def addNegEdge(node1: Node, node2: Node): DepGraph[Node]
- Definition Classes
- DepGraph
- def addNode(n: Node): DepGraph[Node]
- Definition Classes
- DepGraphJGraphT → DepGraph
- def addPosEdge(node1: Node, node2: Node): DepGraph[Node]
- Definition Classes
- DepGraph
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def containsNegCycle: Boolean
- Definition Classes
- DepGraph
- def countNegLinks(nodes: Set[(Node, Node)]): Int
- Definition Classes
- DepGraph
- def edgeBetween(node1: Node, node2: Node): Option[PosNeg]
- Definition Classes
- DepGraphJGraphT → DepGraph
- def empty: DepGraph[Node]
- Definition Classes
- DepGraphJGraphT → DepGraph
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val graph: Graph[Node, Edge]
- def inEdges(node: Node): Either[String, Set[(Node, PosNeg)]]
- Definition Classes
- DepGraphJGraphT → DepGraph
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isomorphicWith(other: DepGraph[Node]): Either[String, Unit]
Checks if this graph is isomorphic with another one
Checks if this graph is isomorphic with another one
- other
the other dependency graph
- returns
Left(msg) if it is not isomorphic or Right(()) if it is isomorphic
- Definition Classes
- DepGraphJGraphT → DepGraph
- lazy val logger: Logger
- Attributes
- protected
- Definition Classes
- LazyLogging
- Annotations
- @transient()
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def negCycles: Set[Set[(Node, Node)]]
- Definition Classes
- DepGraphJGraphT → DepGraph
- def nodes: Set[Node]
- Definition Classes
- DepGraphJGraphT → DepGraph
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def oddNegCycles: Set[Set[(Node, Node)]]
- Definition Classes
- DepGraph
- def outEdges(node: Node): Either[String, Set[(PosNeg, Node)]]
- Definition Classes
- DepGraphJGraphT → DepGraph
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def showEdges(showNode: (Node) => String): String
- Definition Classes
- DepGraphJGraphT → DepGraph
- def showPosNeg(pn: PosNeg): String
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])