Package net.automatalib.graph
Interface BidirectionalGraph<N,E>
-
- Type Parameters:
N
- node classE
- edge class
- All Superinterfaces:
FiniteRepresentation
,Graph<N,E>
,IndefiniteGraph<N,E>
,IndefiniteSimpleGraph<N>
,Iterable<N>
,SimpleGraph<N>
- All Known Subinterfaces:
MutableUniversalBidirectionalGraph<N,E,NP,EP>
,UniversalBidirectionalGraph<N,E,NP,EP>
- All Known Implementing Classes:
AbstractCompactBidiGraph
,CompactBidiGraph
,CompactSimpleBidiGraph
public interface BidirectionalGraph<N,E> extends Graph<N,E>
Interface for bidirectional graph. A bidirectional graph is conceptually the same as a normal (directed) graph, but provides direct access to not only the outgoing, but also the incoming edges of each state.
-
-
Nested Class Summary
Nested Classes Modifier and Type Interface Description static interface
BidirectionalGraph.IntAbstraction<E>
Interface fornode integer abstractions
of aBidirectionalGraph
.
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description Collection<E>
getIncomingEdges(N node)
Retrieves the incoming edges of a given node.N
getSource(E edge)
Retrieves the source node of a given edge.-
Methods inherited from interface net.automatalib.graph.Graph
getAdjacentNodes, getOutgoingEdges, getOutgoingEdgesIterator, getVisualizationHelper
-
Methods inherited from interface net.automatalib.graph.IndefiniteGraph
getAdjacentNodesIterator, getEdgesBetween, getTarget
-
Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph
createDynamicNodeMapping, createStaticNodeMapping, isConnected
-
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Methods inherited from interface net.automatalib.graph.SimpleGraph
getNodes, iterator, nodeIDs, size
-
-
-
-
Method Detail
-
getIncomingEdges
Collection<E> getIncomingEdges(N node)
Retrieves the incoming edges of a given node.- Parameters:
node
- the node- Returns:
- all incoming edges of the specified node.
-
-