Graph Core2.0.0 < Back

Packages

package root
Welcome to the Graph for Scala API reference.
Welcome to the Graph for Scala API reference. Some suggested entry points:
- Graph editing:
  - operators of AnyGraph
  - operators of immutable.Graph and its inner nodes
  - operators of mutable.Graph and its inner nodes.
- Predefined edges:
  - classes in the edges package and its subpackages
  - classes in the hyperedges package and its subpackages.
- Custom edge toolbox:
  - abstract classes in the labeled edges package
  - abstract classes in the multilabeled edges package
  - abstract classes in the labeled hyperedges package
  - abstract classes in the multilabeled hyperedges package
  - abstract classes in the ordered labeled hyperedges package
  - abstract classes in the ordered multilabeled hyperedges object
  - traits in the generic package.
- Graph traversal:
  - methods of GraphTraversal and TraverserInnerNode.
- Random graphs RandomGraph.
- Scalacheck graph generators GraphGen.
Definition Classes
root
package scalax
Definition Classes
root
package collection
Contains the base traits and objects needed to use Graph for Scala.
Contains the base traits and objects needed to use Graph for Scala.
See also the Graph for Scala Core User Guide.
Definition Classes
scalax
trait GraphLike[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with AnyGraph[X, Y]] extends GraphBase[N, E, [X, Y]CC[X, Y]] with GraphTraversal[N, E] with GraphDegree[N, E, [X, Y]CC[X, Y]] with ToString[N, E, [X, Y]CC[X, Y]]
A template trait for graphs.
A template trait for graphs.
This trait provides the common structure and operations of immutable graphs independently of their representation.
If E inherits DiHyperEdgeLike the graph is directed, otherwise it is undirected or mixed.
N
the user type of the nodes (vertices) in this graph.
E
the type of the edges in this graph.
Definition Classes
collection
AbstractTopologicalOrder
BaseInnerEdge
BaseInnerNode
BaseNodeBase
Component
ComponentTraverser
Cycle
Degree
DegreeFunction
DegreeOrdering
EdgeOrdering
EdgeSet
EdgeSetT
EdgeSetToString
ElemOrdering
ExtendedNodeVisitor
Filter
FluentProperties
GraphEdgeSet
GraphInnerEdge
GraphInnerNode
GraphNodeSet
InDegree
Informer
InnerDiEdge
InnerDiHyperEdge
InnerEdge
InnerEdgeTraverser
InnerElem
InnerElemTraverser
InnerHyperEdge
InnerNode
InnerNodeDownUpTraverser
InnerNodeTraverser
InnerOrderedDiHyperEdge
InnerOrderedHyperEdge
InnerUnDiEdge
IntReverseOrdering
Layer
LayeredTopologicalOrder
NoOrdering
Node
NodeBase
NodeOrdering
NodeSet
NodeSetT
NodeSetToString
NodeT
OutDegree
OuterEdge
OuterEdgeTraverser
OuterElem
OuterElemTraverser
OuterNode
OuterNodeDownUpTraverser
OuterNodeTraverser
Path
PathBuilder
Properties
SetToString
StrongComponentTraverser
SubgraphProperties
TopologicalOrder
TopologicalSortFailure
Traverser
TraverserInnerNode
TraverserMethods
Walk
WalkBuilder
Weight

scalax.collection.GraphLike

InnerOrderedDiHyperEdge

Companion class InnerOrderedDiHyperEdge

object InnerOrderedDiHyperEdge

Annotations: @transient()

Linear Supertypes

AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

InnerOrderedDiHyperEdge
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

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(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def toString(): String
Definition Classes
AnyRef → Any
def unapply(edge: CC.InnerOrderedDiHyperEdge): Option[(OneOrMore[CC.NodeT], OneOrMore[CC.NodeT])]
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated

Packages

InnerOrderedDiHyperEdge

Companion class InnerOrderedDiHyperEdge

object InnerOrderedDiHyperEdge

Value Members

Deprecated Value Members

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

InnerOrderedDiHyperEdge

Companion class InnerOrderedDiHyperEdge

object InnerOrderedDiHyperEdge

Value Members

Deprecated Value Members

Inherited from AnyRef

Inherited from Any

Ungrouped

InnerOrderedDiHyperEdge