Package fern.analysis

Provides classes and algorithms for analysing networks like ShortestPath, AutocatalyticDetection.

See:
          Description

Interface Summary
IntSearchStructure Implementing class can be used as search structure for searches in AnalysisBase.
NetworkSearchAction Implementing classes of NetworkSearchAction are able to control/watch searches in AnalysisBase.
NodeChecker Implementing classes can be used for a NetworkSearchActions checkReaction, checkSpecies, if the information whether or not to visit the nodes is not accessible for the NetworkSearchAction.
 

Class Summary
AnalysisBase This class can be used as a base class for many analysis algorithms (like AutocatalticNetworkDetection, ShortestPath, ...).
AutocatalyticNetworkDetection Detects the autocatalytic set of the given network if there is any.
IntQueue IntQueue is an search structure for AnalysisBase representing an fifo queue for a breadth first search.
IntStack IntStack is an search structure for AnalysisBase representing an lifo stack for a depth first search.
NodeCheckerByAnnotation An instance of NodeCheckerByAnnotation can be used to control a search in AnalysisBase by a NetworkSearchAction.
ShortestPath Computes shortest paths in the network by a bfs.
 

Enum Summary
NetworkSearchAction.NeighborType Defines different types of neighborhoods in a Network.
 

Package fern.analysis Description

Provides classes and algorithms for analysing networks like ShortestPath, AutocatalyticDetection.