Packages

trait MutableFactory[+CC[N, E <: Edge[N]] <: Graph[N, E] with mutable.GraphLike[N, E, CC]] extends GenericGraphCoreFactory[CC]

Linear Supertypes
GenericGraphCoreFactory[CC], DefaultConfig[CC], GenericGraphFactory[CC], Factory[CC], AnyRef, Any
Known Subclasses
DefaultGraphImpl, Graph
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MutableFactory
  2. GenericGraphCoreFactory
  3. DefaultConfig
  4. GenericGraphFactory
  5. Factory
  6. AnyRef
  7. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def empty[N, E <: Edge[N]](implicit config: GraphConfig = defaultConfig): CC[N, E]

    Creates an empty Graph instance.

    Creates an empty Graph instance.

    Definition Classes
    GenericGraphFactory
  2. abstract def from[N, E <: Edge[N]](nodes: Iterable[N], edges: Iterable[E])(implicit config: GraphConfig = defaultConfig): 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
    GenericGraphFactory
  3. abstract def from[N, E[X] <: Edge[X]](edges: Iterable[E[N]]): CC[N, E[N]]
    Definition Classes
    GenericGraphFactory

Concrete Value Members

  1. def apply[N, E[X] <: Edge[X]](elems: OuterElem[N, E[N]]*)(implicit config: GraphConfig = defaultConfig): CC[N, E[N]]

    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
    GenericGraphFactory
  2. def defaultConfig: CoreConfig
    Definition Classes
    DefaultConfig
  3. def fill[N, E <: Edge[N]](nr: Int)(elem: => OuterElem[N, E])(implicit config: GraphConfig = defaultConfig): 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
    GenericGraphFactory
  4. def newBuilder[N, E <: Edge[N]](implicit config: GraphConfig): Builder[N, E, CC]
    Definition Classes
    MutableFactory → Factory