MutableGraphCompanion

Type Members

type Coll = CC[_, Nothing]

Attributes
protected
Definition Classes
GraphCompanion
type Config = CoreConfig

Type of configuration required for a specific Graph companion.
Type of configuration required for a specific Graph companion.

Definition Classes
GraphCoreCompanion → GraphCompanion
class GraphCanBuildFrom[N, E[X] <: EdgeLikeIn[X]] extends CanBuildFrom[Coll, GraphParamIn[N, E], CC[N, E]]

Definition Classes
GraphCompanion

Abstract Value Members

abstract def empty[N, E[X] <: EdgeLikeIn[X]](implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

Creates an empty Graph instance.
Creates an empty Graph instance.

Definition Classes
GraphCoreCompanion → GraphCompanion
abstract def from[N, E[X] <: EdgeLikeIn[X]](nodes: Iterable[N], edges: Iterable[E[N]])(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

Produces a graph with a node set containing all nodes and edge ends in edges and with an edge set containing all edges but duplicates.
Produces a graph with a node set containing all nodes and edge ends in edges and with an edge set containing all edges but duplicates. Duplicate exclusion takes place on the basis of values returned by hashCode of the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such as weight or label. 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 mix ExtendedKey into 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 nodes and all edge ends and edges.

Definition Classes
GraphCoreCompanion → GraphCompanion
abstract def fromStream[N, E[X] <: EdgeLikeIn[X]](nodeStreams: Iterable[NodeInputStream[N]], nodes: Iterable[N], edgeStreams: Iterable[GenEdgeInputStream[N, E]], edges: Iterable[E[N]])(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

Creates a graph with nodes and edges read in from the input streams nodeStreams/edgeStreams and from nodes/edges.
Creates a graph with nodes and edges read in from the input streams nodeStreams/edgeStreams and from nodes/edges.
Node/edge streams are an efficient way to populate Graph instances from external resources such as a database. The user has to implement his input stream classes deriving them from NodeInputStream/EdgeInputStream.
N
type of nodes.
E
kind of type of edges.
nodeStreams
list of node input streams to be processed. All nodes read from any of these streams will be added to this graph. Note that only isolated nodes must be included in a stream or in nodes, non-isolated nodes are optional.
nodes
The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with. This parameter may be used as an alternative or in addition to nodeStreams.
edgeStreams
list of edge input streams, each with its own edge factory, to be processed. All edges and edge ends (nodes) read from any of these streams will be added to this graph.
edges
The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set. This parameter is meant be used as an alternative or in addition to edgeStreams.

Definition Classes
GraphCoreCompanion → GraphCompanion

Concrete 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, E[X] <: EdgeLikeIn[X]](elems: GraphParamIn[N, E]*)(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

Creates a Graph with a node set built from all nodes in elems including edge ends and with an edge set containing all edges in elems.
Creates a Graph with a node set built from all nodes in elems including edge ends and with an edge set containing all edges in elems. Duplicate exclusion takes place on the basis of values returned by hashCode of the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such as weight or label. 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 mix ExtendedKey into 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
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@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
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: ⇒ GraphParamIn[N, E])(implicit edgeManifest: Manifest[E[N]], config: Config): CC[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 hashCode of the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such as weight or label. 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 mix ExtendedKey into your custom edge class.
nr
the number of elements to be contained in the graph.
elem
the element computation returning nodes or edges nr times.
returns
A graph that contains the results of nr evaluations of elem.

Definition Classes
GraphCoreCompanion → GraphCompanion
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
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
def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeManifest: Manifest[E[N]], config: Config): Builder[GraphParamIn[N, E], CC[N, E]]

Definition Classes
MutableGraphCompanion → GraphCompanion
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()

trait MutableGraphCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: mutable.Graph[N, E[X]] with mutable.GraphLike[N, E[X], CC]] extends GraphCoreCompanion[CC]

Type Members

type Coll = CC[_, Nothing]

type Config = CoreConfig

class GraphCanBuildFrom[N, E[X] <: EdgeLikeIn[X]] extends CanBuildFrom[Coll, GraphParamIn[N, E], CC[N, E]]

Abstract Value Members

abstract def empty[N, E[X] <: EdgeLikeIn[X]](implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

abstract def from[N, E[X] <: EdgeLikeIn[X]](nodes: Iterable[N], edges: Iterable[E[N]])(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

abstract def fromStream[N, E[X] <: EdgeLikeIn[X]](nodeStreams: Iterable[NodeInputStream[N]], nodes: Iterable[N], edgeStreams: Iterable[GenEdgeInputStream[N, E]], edges: Iterable[E[N]])(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def apply[N, E[X] <: EdgeLikeIn[X]](elems: GraphParamIn[N, E]*)(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def defaultConfig: CoreConfig

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def fill[N, E[X] <: EdgeLikeIn[X]](nr: Int)(elem: ⇒ GraphParamIn[N, E])(implicit edgeManifest: Manifest[E[N]], config: Config): CC[N, E]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeManifest: Manifest[E[N]], config: Config): Builder[GraphParamIn[N, E], CC[N, E]]

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from GraphCoreCompanion[CC]

Inherited from GraphCompanion[CC]

Inherited from AnyRef

Inherited from Any

Ungrouped