object Graph extends GraphCoreCompanion[Graph] with Serializable
The main companion object for immutable graphs.
- Alphabetic
- By Inheritance
- Graph
- Serializable
- Serializable
- GraphCoreCompanion
- GraphCompanion
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
Coll = Graph[_, Nothing]
- Attributes
- protected[this]
- Definition Classes
- GraphCompanion
-
type
Config = CoreConfig
Type of configuration required for a specific
Graphcompanion.Type of configuration required for a specific
Graphcompanion.- Definition Classes
- GraphCoreCompanion → GraphCompanion
-
class
GraphCanBuildFrom[N, E[X] <: EdgeLikeIn[X]] extends CanBuildFrom[Coll, Param[N, E], CC[N, E]]
- Definition Classes
- GraphCompanion
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
apply[N, E[X] <: EdgeLikeIn[X]](elems: Param[N, E]*)(implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): Graph[N, E]
Creates a
Graphwith a node set built from all nodes inelemsincluding edge ends and with an edge set containing all edges inelems.Creates a
Graphwith a node set built from all nodes inelemsincluding edge ends and with an edge set containing all edges inelems. Duplicate exclusion takes place on the basis of values returned byhashCodeof the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such asweightorlabel. To include non-node edge components in the hash-code of an edge make use of any of the predefined key-weighted/key-labeled edges or mixExtendedKeyinto your custom edge class.- elems
sequence of nodes and/or edges in an arbitrary order
- returns
A new graph instance containing the nodes and edges derived from
elems.
- Definition Classes
- GraphCoreCompanion → GraphCompanion
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- implicit def cbfDi[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): GraphCanBuildFrom[N, E] with CanBuildFrom[Graph[_, DiEdge], Param[N, E], Graph[N, E]]
- implicit def cbfUnDi[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): GraphCanBuildFrom[N, E] with CanBuildFrom[Graph[_, UnDiEdge], Param[N, E], Graph[N, E]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
defaultConfig: CoreConfig
The default configuration to be used in absence of a user-supplied configuration.
The default configuration to be used in absence of a user-supplied configuration.
- Definition Classes
- GraphCoreCompanion → GraphCompanion
-
def
empty[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): Graph[N, E]
Creates an empty
Graphinstance.Creates an empty
Graphinstance.- Definition Classes
- Graph → GraphCoreCompanion → GraphCompanion
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
fill[N, E[X] <: EdgeLikeIn[X]](nr: Int)(elem: ⇒ Param[N, E])(implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): Graph[N, E]
Produces a graph containing the results of some element computation a number of times.
Produces a graph containing the results of some element computation a number of times. Duplicate exclusion takes place on the basis of values returned by
hashCodeof the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such asweightorlabel. To include non-node edge components in the hash-code of an edge make use of any of the predefined key-weighted/key-labeled edges or mixExtendedKeyinto your custom edge class.- nr
the number of elements to be contained in the graph.
- elem
the element computation returning nodes or edges
nrtimes.- returns
A graph that contains the results of
nrevaluations ofelem.
- Definition Classes
- GraphCoreCompanion → GraphCompanion
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
from[N, E[X] <: EdgeLikeIn[X]](nodes: Traversable[N] = Nil, edges: Traversable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): Graph[N, E]
Produces a graph with a node set containing all
nodesand edge ends inedgesand with an edge set containing alledgesbut duplicates.Produces a graph with a node set containing all
nodesand edge ends inedgesand with an edge set containing alledgesbut duplicates. Duplicate exclusion takes place on the basis of values returned byhashCodeof the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such asweightorlabel. To include non-node edge components in the hash-code of an edge make use of any of the predefined key-weighted/key-labeled edges or mixExtendedKeyinto your custom edge class.- nodes
the isolated and optionally any other non-isolated nodes to be included in the node set of the graph to be created.
- edges
all edges to be included in the edge set of the graph to be created. Edge ends will be added to the node set automatically.
- returns
A new graph instance containing
nodesand all edge ends andedges.
- Definition Classes
- Graph → GraphCoreCompanion → GraphCompanion
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], immutable.Graph[N, E]]
- Definition Classes
- Graph → GraphCompanion
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
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
- @native() @throws( ... )
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.