Class LabeledGraph
java.lang.Object
se.liu.ida.hefquin.engine.wrappers.lpg.utils.LabeledGraph
This class models graphs with labeled edges. Nodes and edge labels are modeled as
CypherVar
objects.
Edges can be directed or not. A pair of nodes can have an arbitrary number of edges between them. Nodes can
have edges that start and end on themselves.-
Nested Class Summary
Modifier and TypeClassDescriptionstatic enum
Enum for the possible edge directionsstatic class
An edge of a labeled graph has an id, an edge label, a target node and a directionstatic class
Represents a path in a graph, starting from a given node and following a sequence of edges. -
Field Summary
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionboolean
Enumerates all possible paths and returns the longest found.int
hashCode()
boolean
isEmpty()
void
removePath
(LabeledGraph.Path path) removes the edges contained in pathtoString()
-
Field Details
-
adjacencyLists
-
-
Constructor Details
-
LabeledGraph
-
-
Method Details
-
removePath
removes the edges contained in path -
getLongestPath
Enumerates all possible paths and returns the longest found. In case of ties, it returns the first longest path found. -
isEmpty
public boolean isEmpty() -
toString
-
equals
-
hashCode
public int hashCode()
-