This interface defines an adjacency list (AL) generator.
This interface represents a generic graph traversal.
A breadth-first like traversal that will return the same atom multiple times - once for each distinct link leading to it.
A default implementation of the
A collection of classical graph algorithms implemented within the HyperGraphDB framework.
Implements a breadth-first search of a graph.
Implements a depth-first search of a graph.
This class is work in progress - it was done to solve the immediate problem of transferring a sub-graph from one location to another.
Copyright © 2015. All rights reserved.