|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |
key=value
with key = alpha+
value = any+ | "qany+"
alpha = [a-z] | [A-Z] | [0-9] | '_'
any = [^ |"]
qany = [^"]
note: Please note that the '-' (dash) character is not allowed in key and is only
allowed in values if it is quoted.
p [label] : problem line : label is from graph registry Label
n [label] + : vertex lines : label is from vertex registry Label
e index1 index2 [label] : edge line : indexi are 1-based index refereing to
vertices (see below).- DimacsExtendedWriter(Writer) -
Constructor for class helix.graph.io.DimacsExtendedWriter
- constructor
- DimacsReader - Class in helix.graph.io
- Extended Dimacs format :
[c [comment]] : comment line : may appear anywhere
[p [label]] : problem line : label is kept in graph registry as Label
[n [label]]+ : vertex line : label is kept in vertex registry as Label
e index1 index2 [label] : edge line : indexi are 1-based index refereing to
vertices (see below).- DimacsReader(Reader, GraphFactory) -
Constructor for class helix.graph.io.DimacsReader
- default constructor
- DimacsReader(Reader, GraphFactory, Logger) -
Constructor for class helix.graph.io.DimacsReader
- constructor with logging addition
- disconnectVertex(Vertex) -
Method in interface helix.graph.model.Graph
-
- disconnectVertex(Vertex) -
Method in class helix.graph.model.impl.AbstractGraph
-
- Distance -
Static variable in class helix.graph.algo.Dijkstra
-
- distance(Vertex) -
Method in class helix.graph.algo.Dijkstra
- get distance from source to target
return -1 if target is not connected to source
- distance(Vertex, Vertex) -
Method in class helix.graph.algo.Warshall
- get shortest path between vertex u and v
- DuplicateEdgeException - Exception in helix.graph.model
-
- DuplicateEdgeException() -
Constructor for exception helix.graph.model.DuplicateEdgeException
-
- DuplicateEdgeException(String) -
Constructor for exception helix.graph.model.DuplicateEdgeException
-
- DuplicateEdgeException(Throwable) -
Constructor for exception helix.graph.model.DuplicateEdgeException
-
- DuplicateValueException - Exception in helix.graph.model
-
- DuplicateValueException() -
Constructor for exception helix.graph.model.DuplicateValueException
-
- DuplicateValueException(String) -
Constructor for exception helix.graph.model.DuplicateValueException
-
- DuplicateValueException(Throwable) -
Constructor for exception helix.graph.model.DuplicateValueException
-
- duplicateVertex(Graph, Vertex) -
Static method in class helix.graph.algo.Cloner
- duplicate a single vertex in a graph
note: this is quicker than calling duplicateVertices
with a singleton
-1- duplicate vertex v to copy(v)
-2- foreach edge (v, u)
createEdge(copy(v), u)
- duplicateVertices(Graph, GSet<Vertex>) -
Static method in class helix.graph.algo.Cloner
- duplicate a set of vertices within the same graph
-1- duplicate each vertex v in vertices to copy(v)
-2- foreach vertex v in vertices
foreach edge (v, u)
createEdge(copy(v), u')
with u' = (hasCopy(u) ? copy(u) : u)
|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |