net.automatalib.graphs

Interface BidirectionalGraph<N,E>

Type Parameters:

N - node class

E - edge class

All Superinterfaces:

Graph<N,E>, IndefiniteGraph<N,E>, Iterable<N>

All Known Implementing Classes:

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.

Author:

Malte Isberner

Method Summary

Modifier and Type	Method and 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.graphs.Graph

getNodes, nodeIDs, size

Methods inherited from interface net.automatalib.graphs.IndefiniteGraph

createDynamicNodeMapping, createStaticNodeMapping, getOutgoingEdges, getTarget

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

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.

getSource

N getSource(E edge)

Retrieves the source node of a given edge.

Parameters:

edge - the edge

Returns:

the source node of the given edge