| Interface | Description |
|---|---|
| DirectedGraphNodeI |
Represents a node in a directed graph that is aware of both its incoming and
outgoing edges.
|
| GraphEdgeFilterI |
Interface to be implemented by classes which can filter
GraphEdgeI
instances according to some criteria. |
| GraphEdgeI |
Represents a directed edge in a graph, connecting a source (or "from") node
to a target (or "to") node.
|
| GraphNodeMatcherI<N extends OnlyToDirectedGraphNodeI> |
Defines criteria that graph node objects (implementing
OnlyToDirectedGraphNodeI)
must meet to be considered a "match". |
| OnlyToDirectedGraphNodeI |
Represents a node in a directed graph where traversal or knowledge is primarily
focused on outgoing paths ("where we're going to").
|
| Class | Description |
|---|---|
| DefaultGraphEdge |
A straightforward, immutable implementation of the
GraphEdgeI interface. |
| GraphPath |
Represents an immutable, ordered sequence of connected
edges
originating from a specific GraphPath.startNode (an OnlyToDirectedGraphNodeI)
in a graph. |
| GraphTools |
A utility class containing various static graph algorithms.
|
Copyright © 2000-2025 OAshi S.à r.l. All Rights Reserved.