AbstractEdgeTraversalResult

com.phasmidsoftware.gryphon.traverse.AbstractEdgeTraversalResult
abstract class AbstractEdgeTraversalResult[T](ts: List[T]) extends TraversalResult[Int, T]

Abstract base class for edge traversal within a graph. This class supports traversing edges in a graph-like structure by providing a specific implementation for edge traversal while delegating the vertex traversal to throw an exception, as it is not applicable for edge-based traversal.

Type parameters

T

the type representing the result of the edge traversal

Value parameters

ts

a list of elements of type T representing traversal data, typically associated with edges

Attributes

Graph
Supertypes
trait TraversalResult[Int, T]
class Object
trait Matchable
class Any
Known subtypes
class EdgeTraversalResult[V, E, T]

Members list

Value members

Concrete methods

def edgeTraverse(x: Int): T

Traverses a specified edge within a graph-like structure and produces a result of type T.

Traverses a specified edge within a graph-like structure and produces a result of type T.

Value parameters

x

the index of the edge to be traversed

Attributes

Returns

the result of the traversal

def keySet: Set[Int]

Retrieves the set of keys from the underlying map that represents the traversal result.

Retrieves the set of keys from the underlying map that represents the traversal result.

Attributes

Returns

a set of keys of type V contained in the underlying map.

def size: Int

Returns the number of key-value pairs in the map.

Returns the number of key-value pairs in the map.

Attributes

Returns

the size of the map as an integer

def vertexTraverse(v: Int): Option[T]

Traverses a given vertex in the graph and returns the result of the traversal.

Traverses a given vertex in the graph and returns the result of the traversal.

Value parameters

v

the vertex to be traversed.

Attributes

Returns

the result of the traversal for the provided vertex.