A bidirectional edge on the graph to be searched.
It must implement
Interface representing an algorithm that searches a graph.
Callback used by the search algorithms.
This interface is responsible for providing the edges of the graph and it can be notified of some events generated by the search.
Super-class for ISearchCallback implementations that needs to filter which nodes should be included or excluded from the search.
This class implements the
Search using depth-first algorithm.
An instance of this class must be used only once, as it maintains the internal state of the search.
Basic implementation of the
Base class for exceptions during the search.
Copyright © 2002–2016. All rights reserved.