Package com.amalgamasimulation.graph

Interface Algorithm.GraphTraversalPredicate<A,B>

Enclosing interface:

Algorithm

Functional Interface:

This is a functional interface and can therefore be used as the assignment target for a lambda expression or method reference.

@FunctionalInterface
public static interface Algorithm.GraphTraversalPredicate<A,B>

Functional interface for a predicate answering the question "Can we traverse the arc and the node adjacent to this arc?"

Example of implementation:

(addedArc, addedNode, addedArcDirection) -> true

See Also:

• Algorithm.traverse(com.amalgamasimulation.graph.Graph.Node, Object, GraphTraversalPredicate, GraphTraversalContextCalculator, GraphTraversalEndPredicate)

Method Summary

Modifier and Type	Method	Description
boolean	canAddArcAndNode(Graph<A,B>.Arc addedArc, Graph<A,B>.Node addedNode, Algorithm.ArcRelativeDirection addedArcDirection)	Predicate answering the question "Can we traverse the arc and the node adjacent to this arc?"

Method Details

canAddArcAndNode

boolean canAddArcAndNode(Graph<A,B>.Arc addedArc,
 Graph<A,B>.Node addedNode,
 Algorithm.ArcRelativeDirection addedArcDirection)

Predicate answering the question "Can we traverse the arc and the node adjacent to this arc?"

Parameters:

addedArc - arc being tested

addedNode - a new node that would be connected by the added arc being tested

addedArcDirection - direction of the arc begin tested, Algorithm.ArcRelativeDirection.OUTGOING or Algorithm.ArcRelativeDirection.INCOMING

Returns:

true if we should traverse the added arc, false otherwise

See Also:

• Algorithm.GraphTraversalPredicate