final class GraphComponents[N, E[X] <: EdgeLikeIn[X]] extends Logging
Provides algorithms for finding graph components.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- GraphComponents
- Logging
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new GraphComponents(g: Graph[N, E])(implicit edgeT: ClassTag[N])
Type Members
- type DeepSearchStackAggregator = (Seq[Graph.NodeT]) ⇒ Unit
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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
debug(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
debug(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
debug(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
error(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
error(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
error(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- val g: Graph[N, E]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
info(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
info(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
info(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
log: Logger
- Attributes
- protected
- Definition Classes
- Logging
-
def
logName: String
- Attributes
- protected
- Definition Classes
- Logging
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
stronglyConnectedComponentsDag: Graph[Graph[N, DiEdge], DiEdge]
Do Tarjan's algorithm and return the DAG of (cyclic) subgraphs TODO not sound wrt to HyperGraphs
-
def
stronglyConnectedComponentsDag2: Graph[Graph[N, LDiEdge], DiEdge]
Do Tarjan's algorithm and return the DAG of (cyclic) subgraphs TODO not sound wrt to HyperGraphs
-
def
stronglyConnectedNodeSets: Set[Set[Graph.NodeT]]
Do Tarjan's algorithm and return the set of node sets
Do Tarjan's algorithm and return the set of node sets
- returns
Sets of outer nodes
-
def
stronglyConnectedSets: Set[Set[N]]
Do Tarjan's algorithm and return the set of sets
Do Tarjan's algorithm and return the set of sets
- returns
Sets of inner nodes
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
trace(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
trace(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
trace(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
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( ... ) @native()
-
def
warn(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
warn(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
warn(msg: ⇒ String): Unit
- Definition Classes
- Logging