Package | Description |
---|---|
org.hypergraphdb.algorithms | |
org.hypergraphdb.query |
Modifier and Type | Class and Description |
---|---|
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. |
Modifier and Type | Method and Description |
---|---|
HGALGenerator |
HGDepthFirstTraversal.getAdjListGenerator() |
HGALGenerator |
HGBreadthFirstTraversal.getAdjListGenerator() |
HGALGenerator |
CopyGraphTraversal.getAdjListGenerator() |
Modifier and Type | Method and Description |
---|---|
static 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 Double |
GraphClassics.dijkstra(HGHandle start,
HGHandle goal,
HGALGenerator adjacencyGenerator,
Mapping<HGHandle,Double> weight,
Map<HGHandle,Double> distanceMatrix,
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,Double> weight,
Map<HGHandle,HGHandle> parentMatrix) |
void |
HGDepthFirstTraversal.setAdjListGenerator(HGALGenerator adjListGenerator) |
void |
HGBreadthFirstTraversal.setAdjListGenerator(HGALGenerator adjListGenerator) |
void |
CopyGraphTraversal.setAdjListGenerator(HGALGenerator adjListGenerator) |
Constructor and Description |
---|
CopyGraphTraversal(HGHandle startAtom,
HGALGenerator adjListGenerator) |
CopyGraphTraversal(HGHandle startAtom,
HGALGenerator adjListGenerator,
int maxDistance) |
HGBreadthFirstTraversal(HGHandle startAtom,
HGALGenerator adjListGenerator) |
HGBreadthFirstTraversal(HGHandle startAtom,
HGALGenerator adjListGenerator,
int maxDistance) |
HGBreadthFirstTraversal(Ref<HGHandle> startAtom,
HGALGenerator adjListGenerator) |
HGBreadthFirstTraversal(Ref<HGHandle> startAtom,
HGALGenerator adjListGenerator,
int maxDistance) |
HGDepthFirstTraversal(HGHandle startAtom,
HGALGenerator adjListGenerator) |
HGDepthFirstTraversal(Ref<HGHandle> startAtom,
HGALGenerator adjListGenerator) |
Modifier and Type | Method and Description |
---|---|
HGALGenerator |
TraversalCondition.makeGenerator(HyperGraph graph) |
Copyright © 2015. All rights reserved.