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 GraphTraversal[N, E <: Edge[N]] extends GraphBase[N, E, GraphTraversal]

  Graph-related functionality such as traversals, path finding, cycle detection etc.

  Graph-related functionality such as traversals, path finding, cycle detection etc. All algorithms including breadth-first, depth-first, white-gray-black search and Dijkstra's algorithm are tail recursive.

  Before starting a traversal a Traverser such as scalax.collection.GraphTraversal#InnerNodeTraverser is instantiated explicitly or implicitly. It holds settings like maxDepth, subgraph or ordering providing a fine-grained control of the traversal. Traversers also extend scala.collection.Iterable meaning that you can process the visited nodes and edges in a functional way.

  Definition Classes

  collection

  See also

  http://www.scala-graph.org/guides/core-traversing

• AbstractTopologicalOrder
• BaseInnerEdge
• BaseInnerNode
• BaseNodeBase
• Component
• ComponentTraverser
• Cycle
• EdgeOrdering
• EdgeSet
• EdgeSetT
• EdgeT
• ElemOrdering
• ExtendedNodeVisitor
• FluentProperties
• Informer
• InnerEdge
• InnerEdgeTraverser
• InnerElem
• InnerElemTraverser
• InnerNode
• InnerNodeDownUpTraverser
• InnerNodeTraverser
• Layer
• LayeredTopologicalOrder
• NoOrdering
• Node
• NodeOrdering
• NodeSet
• NodeSetT
• NodeT
• OuterEdge
• OuterEdgeTraverser
• OuterElem
• OuterElemTraverser
• OuterNode
• OuterNodeDownUpTraverser
• OuterNodeTraverser
• Path
• PathBuilder
• Properties
• StrongComponentTraverser
• SubgraphProperties
• TopologicalOrder
• TopologicalSortFailure
• Traverser
• TraverserInnerNode
• TraverserMethods
• Walk
• WalkBuilder
• Weight

scalax.collection.GraphTraversal

ExtendedNodeVisitor

Companion trait ExtendedNodeVisitor