Uses of Interface
org.hypergraphdb.algorithms.HGALGenerator

Packages that use HGALGenerator

org.hypergraphdb.algorithms
org.hypergraphdb.query

Uses of HGALGenerator in org.hypergraphdb.algorithms

Classes in org.hypergraphdb.algorithms that implement HGALGenerator

class	DefaultALGenerator A default implementation of the HGALGenerator that should cover most common cases.
class	SimpleALGenerator The SimpleALGenerator produces all atoms linked to the given atom, regardless of the link type and regardless of how an outgoing set is ordered.

Methods in org.hypergraphdb.algorithms with parameters of type HGALGenerator

static java.lang.Double	GraphClassics.dijkstra(HGHandle start, HGHandle goal, HGALGenerator adjencyGenerator) Simplified interface to Dijkstra's algorithm - calls the full version with the remaining arguments set to null.
static java.lang.Double	GraphClassics.dijkstra(HGHandle start, HGHandle goal, HGALGenerator adjencyGenerator, Mapping<HGHandle,java.lang.Double> weight, java.util.Map<HGHandle,java.lang.Double> distanceMatrix, java.util.Map<HGHandle,HGHandle> predecessorMatrix) Implements Dijkstra's algorithm for finding the shortest path between two nodes (i.e.
static boolean	GraphClassics.hasCycles(HGHandle root, HGALGenerator adjencyGenerator) Detect whether a sub-graph has cycles.
void	GraphClassics.prim(HGHandle start, HGALGenerator adjencyGenerator, Mapping<HGHandle,java.lang.Double> weight, java.util.Map<HGHandle,HGHandle> parentMatrix)

Constructors in org.hypergraphdb.algorithms with parameters of type HGALGenerator

HGBreadthFirstTraversal(HGHandle startAtom, HGALGenerator adjListGenerator)

HGDepthFirstTraversal(HGHandle startAtom, HGALGenerator adjListGenerator)

Uses of HGALGenerator in org.hypergraphdb.query

Methods in org.hypergraphdb.query that return HGALGenerator

HGALGenerator

TraversalCondition.makeGenerator(HyperGraph graph)