scalax
.
collection
.
constrained
DAG
object
DAG
extends
CompanionAlias
[
DiEdge
] with
Serializable
Companion module for default (immutable) directed acyclic
Graph
.
Linear Supertypes
Serializable
,
Serializable
,
CompanionAlias
[
DiEdge
],
GraphConstrainedCompanionAlias
[
Graph
,
DiEdge
],
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
DAG
Serializable
Serializable
CompanionAlias
GraphConstrainedCompanionAlias
AnyRef
Any
Hide All
Show all
Learn more about member selection
Visibility
Public
All
Value Members
final
def
!=
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
==
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
def
apply
[
N
]
(
elems:
GraphParamIn
[
N
,
DiEdge
]*
)
(
implicit
edgeManifest:
Manifest
[
DiEdge
[
N
]]
,
config:
GraphConfig
)
:
Graph
[
N
,
DiEdge
]
Definition Classes
GraphConstrainedCompanionAlias
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
empty
[
N
]
(
implicit
edgeManifest:
Manifest
[
DiEdge
[
N
]]
,
config:
GraphConfig
)
:
Graph
[
N
,
DiEdge
]
Definition Classes
GraphConstrainedCompanionAlias
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
from
[
N
]
(
nodes:
Iterable
[
N
]
,
edges:
Iterable
[
DiEdge
[
N
]]
)
(
implicit
edgeManifest:
Manifest
[
DiEdge
[
N
]]
,
config:
GraphConfig
)
:
Graph
[
N
,
DiEdge
]
Definition Classes
GraphConstrainedCompanionAlias
def
fromStream
[
N
]
(
nodeStreams:
Iterable
[
NodeInputStream
[
N
]] =
Seq.empty[NodeInputStream[N]]
,
nodes:
Iterable
[
N
] =
Seq.empty[N]
,
edgeStreams:
Iterable
[
GenEdgeInputStream
[
N
,
DiEdge
]] =
Seq.empty[GenEdgeInputStream[N,E]]
,
edges:
Iterable
[
DiEdge
[
N
]] =
Seq.empty[E[N]]
)
(
implicit
edgeManifest:
Manifest
[
DiEdge
[
N
]]
,
config:
GraphConfig
)
:
Graph
[
N
,
DiEdge
]
Definition Classes
GraphConstrainedCompanionAlias
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toString
()
:
String
Definition Classes
AnyRef → Any
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
(
...
)
Inherited from
Serializable
Inherited from
Serializable
Inherited from
CompanionAlias
[
DiEdge
]
Inherited from
GraphConstrainedCompanionAlias
[
Graph
,
DiEdge
]
Inherited from
AnyRef
Inherited from
Any
Ungrouped
Companion module for default (immutable) directed acyclic
Graph
.