|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of GSet in helix.graph.algo |
---|
Methods in helix.graph.algo that return GSet | |
---|---|
GSet<Vertex> |
ComponentsFinder.component(Vertex v)
return component containing vertex v |
static GSet<Vertex> |
Cloner.duplicateVertices(Graph graph,
GSet<Vertex> vertices)
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)
|
Methods in helix.graph.algo that return types with arguments of type GSet | |
---|---|
Set<GSet<Vertex>> |
ComponentsFinder.connectedComponents()
return all connected components of graph |
Iterable<GSet<Vertex>> |
CCVisitor.getComponents()
|
Methods in helix.graph.algo with parameters of type GSet | |
---|---|
static GSet<Vertex> |
Cloner.duplicateVertices(Graph graph,
GSet<Vertex> vertices)
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)
|
Uses of GSet in helix.graph.algo.c3part.aggregator |
---|
Methods in helix.graph.algo.c3part.aggregator that return GSet | |
---|---|
GSet<Vertex> |
NodeAggregator.getTerminals(Vertex V,
int color)
returns the set of datagraph terminals nodes {v} of given color that can be aggregated to a given multigraph vertex V = (v1,..., vk). |
Uses of GSet in helix.graph.algo.c3part.compressor |
---|
Methods in helix.graph.algo.c3part.compressor that return GSet | |
---|---|
GSet<Vertex> |
NoCompressor.retrieveSet()
|
GSet<Vertex> |
GraphCompressor.retrieveSet()
retrieve previously stored set this is an optional operation |
GSet<Vertex> |
AbstractCompressor.retrieveSet()
retrieve a copy of previously stored set optional operation |
Methods in helix.graph.algo.c3part.compressor with parameters of type GSet | |
---|---|
void |
NoCompressor.storeSet(GSet<Vertex> set)
|
void |
GraphCompressor.storeSet(GSet<Vertex> set)
temporarily stores a set of vertices this is an optional operation |
void |
AbstractCompressor.storeSet(GSet<Vertex> set)
temporarily stores a copy of set of vertices optional operation |
Uses of GSet in helix.graph.algo.c3part.lookahead |
---|
Methods in helix.graph.algo.c3part.lookahead that return GSet | |
---|---|
GSet<Vertex> |
LookaheadConnector.getLookahead(Graph datagraph,
Graph multigraph,
int color)
get the pseudoterminals and return a new GSet[Vertex] |
Methods in helix.graph.algo.c3part.lookahead with parameters of type GSet | |
---|---|
void |
TwoWayPathConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
|
void |
TerminalsConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
|
void |
OneWayPathConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
|
abstract void |
LookaheadConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
get the pseudoterminals and append them into 'store'. |
void |
FullColorConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
|
void |
ColorPathConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
get the connected component of all datanodes in multigraph terminals following only links of terminal color. |
void |
AllPathConnector.getLookAhead(Graph datagraph,
Graph multigraph,
int color,
GSet<Vertex> store)
|
Uses of GSet in helix.graph.algo.c3part.visitor |
---|
Methods in helix.graph.algo.c3part.visitor that return types with arguments of type GSet | |
---|---|
Iterable<GSet<Vertex>> |
CCSuperStarByColorVisitor.getComponents()
|
Iterable<GSet<Vertex>> |
CCStarByColorVisitor.getComponents()
|
Uses of GSet in helix.graph.model |
---|
Methods in helix.graph.model that return GSet | |
---|---|
GSet<E> |
GSet.findMultiple(String registryKey,
Object anyValue)
|
GSet<E> |
GSet.findMultiple(String registryKey,
RegistryValue registryValue)
|
GSet<Vertex> |
Graph.findVertices(String registryKey,
Object anyValue)
|
GSet<Vertex> |
Graph.findVertices(String registryKey,
RegistryValue registryValue)
|
GSet<E> |
GSetFactory.make()
|
GSet<E> |
GSetFactory.make(Iterable<E> elements)
|
Methods in helix.graph.model that return types with arguments of type GSet | |
---|---|
Set<GSet<E>> |
GSetFactory.makeSuper()
|
Method parameters in helix.graph.model with type arguments of type GSet | |
---|---|
Set<Graph> |
Graph.physicalSplit(Iterable<GSet<Vertex>> splits)
|
Uses of GSet in helix.graph.model.impl |
---|
Methods in helix.graph.model.impl that return GSet | |
---|---|
GSet<Vertex> |
AbstractGraph.findVertices(String registryKey,
Object anyValue)
|
GSet<Vertex> |
AbstractGraph.findVertices(String registryKey,
RegistryValue registryValue)
|
GSet<E> |
AbstractGSetFactory.make(Iterable<E> elements)
|
Method parameters in helix.graph.model.impl with type arguments of type GSet | |
---|---|
Set<Graph> |
AbstractGraph.physicalSplit(Iterable<GSet<Vertex>> splits)
TODO a documenter serieusement en particulier : destroy the current graph accepte un visiteur a classes recouvrantes et non totalement couvrant |
Uses of GSet in helix.graph.model.impl.memory |
---|
Classes in helix.graph.model.impl.memory that implement GSet | |
---|---|
class |
MemGSet<E extends GraphElement>
|
Methods in helix.graph.model.impl.memory that return GSet | |
---|---|
GSet<E> |
MemGSet.findMultiple(String registryKey,
Object anyValue)
|
GSet<E> |
MemGSet.findMultiple(String registryKey,
RegistryValue registryValue)
|
GSet<E> |
MemGSetFactory.make()
|
Methods in helix.graph.model.impl.memory that return types with arguments of type GSet | |
---|---|
Set<GSet<E>> |
MemGSetFactory.makeSuper()
|
Uses of GSet in helix.graph.util |
---|
Methods in helix.graph.util with parameters of type GSet | |
---|---|
void |
GraphDebugger.log(GSet<Vertex> set)
|
void |
GraphDebugger.log(GSet<Vertex> set,
String header)
print set of vertices |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |