- 
- Type Parameters:
- N- node class
- E- 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:
- AbstractCompactUniversalBidiGraph,- CompactSimpleBidiGraph,- CompactUniversalBidiGraph
 
 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 SummaryNested Classes Modifier and Type Interface Description static interfaceBidirectionalGraph.IntAbstraction<E>Interface fornode integer abstractionsof aBidirectionalGraph.
 - 
Method SummaryAll Methods Instance Methods Abstract Methods Modifier and Type Method Description Collection<E>getIncomingEdges(N node)Retrieves the incoming edges of a given node.NgetSource(E edge)Retrieves the source node of a given edge.- 
Methods inherited from interface net.automatalib.graph.GraphgetAdjacentNodes, getOutgoingEdges, getOutgoingEdgesIterator, getVisualizationHelper
 - 
Methods inherited from interface net.automatalib.graph.IndefiniteGraphgetAdjacentNodesIterator, getEdgesBetween, getTarget
 - 
Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraphisConnected
 - 
Methods inherited from interface java.lang.IterableforEach, spliterator
 - 
Methods inherited from interface net.automatalib.graph.SimpleGraphcreateDynamicNodeMapping, createStaticNodeMapping, getNodes, iterator, nodeIDs, size
 
- 
 
- 
- 
- 
Method Detail- 
getIncomingEdgesCollection<E> getIncomingEdges(N node) Retrieves the incoming edges of a given node.- Parameters:
- node- the node
- Returns:
- all incoming edges of the specified node
 
 
- 
 
-