|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of Vertex in helix.graph.algo |
---|
Methods in helix.graph.algo that return Vertex | |
---|---|
static Vertex |
Cloner.duplicateVertex(Graph graph,
Vertex v)
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)
|
Vertex |
Dijkstra.getSource()
get current source |
Methods in helix.graph.algo that return types with arguments of type Vertex | |
---|---|
GSet<Vertex> |
ComponentsFinder.component(Vertex v)
return component containing vertex v |
Set<GSet<Vertex>> |
ComponentsFinder.connectedComponents()
return all connected components of graph |
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)
|
Iterable<GSet<Vertex>> |
CCVisitor.getComponents()
|
List<Vertex> |
Dijkstra.shortestPath(Vertex target)
get shortest path from source to target return a list [source, ..., target] or empty list if there is no path |
Methods in helix.graph.algo with parameters of type Vertex | |
---|---|
GSet<Vertex> |
ComponentsFinder.component(Vertex v)
return component containing vertex v |
int |
Dijkstra.distance(Vertex target)
get distance from source to target return -1 if target is not connected to source |
int |
Warshall.distance(Vertex u,
Vertex v)
get shortest path between vertex u and v |
static Vertex |
Cloner.duplicateVertex(Graph graph,
Vertex v)
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)
|
void |
Dijkstra.run(Vertex source)
main Dijkstra algorithm get all distances from source to all vertices in connected component of source (CC(source)) distance are stored into vertices registry with label Dijkstra.Distance note: vertices not in CC(source) do not have the Dijkstra.Distance flag |
List<Vertex> |
Dijkstra.shortestPath(Vertex target)
get shortest path from source to target return a list [source, ..., target] or empty list if there is no path |
boolean |
DeltaClosure.Constraint.validate(Vertex v1,
Vertex v2)
|
void |
Visitor.visit(Vertex v)
|
void |
CCVisitor.visit(Vertex v)
|
Method parameters in helix.graph.algo with type arguments of type Vertex | |
---|---|
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)
|
static Graph |
Cloner.subGraph(Graph src,
Iterable<Vertex> vertices)
make a subgraph from graph restricted to given vertices |
Uses of Vertex in helix.graph.algo.c3part |
---|
Methods in helix.graph.algo.c3part that return Vertex | |
---|---|
static Vertex |
C3PartUtil.getLastNode(Vertex V)
get last datanode of a multinode V Last(V) = vk / Nodes(V) = (v1, ..., vk) |
static Vertex |
C3PartUtil.getMultinode(Vertex v)
get the multinode V such that Nodes(V) = (v) this is used in multigraph initialisation to retrieve the multinode V that has been build from v. |
static Vertex |
C3PartUtil.getRoot(Vertex V)
get root of multinode V return null if V is not an Alias Node |
static Vertex |
C3PartUtil.getSon(Vertex V,
Vertex terminal)
get the multinode son of a multinode V, that ends with specified terminals. |
Methods in helix.graph.algo.c3part with parameters of type Vertex | |
---|---|
static void |
C3PartUtil.addAlias(Vertex V,
Vertex Alias)
add alias into multinode V (also set root of V to Root) |
static void |
C3PartUtil.addNode(Vertex V,
Vertex v)
add datanode v in tuples of a multinode V |
static void |
C3PartUtil.addSon(Vertex V,
Vertex Son)
add son into multinode V |
static int |
MultiGraphDebugger.checkColors(Vertex V,
Vertex U,
String prefix,
boolean fixme)
check colors of edge U-V |
static int |
C3PartUtil.countStars(Vertex V)
count number of stars in multinode V |
static void |
MultiGraphDebugger.fixColors(Vertex V,
Vertex U)
fix colors of edge UV |
static RVertexSet |
C3PartUtil.getAliases(Vertex V)
get multinodes aliases of a multinode V (V is called a root multinode) and create an empty RVertexSet if it does not exist. |
static Vertex |
C3PartUtil.getLastNode(Vertex V)
get last datanode of a multinode V Last(V) = vk / Nodes(V) = (v1, ..., vk) |
static Vertex |
C3PartUtil.getMultinode(Vertex v)
get the multinode V such that Nodes(V) = (v) this is used in multigraph initialisation to retrieve the multinode V that has been build from v. |
static RVertexList |
C3PartUtil.getNodes(Vertex V)
get datanodes tuple of a multinode V (i.e. |
static RColorSet |
C3PartUtil.getPseudoColors(Vertex V,
Vertex U)
compute pseudo colors of edge (U, V) using the datagraph (i.e not relying on an actual edge). |
static Vertex |
C3PartUtil.getRoot(Vertex V)
get root of multinode V return null if V is not an Alias Node |
static Vertex |
C3PartUtil.getSon(Vertex V,
Vertex terminal)
get the multinode son of a multinode V, that ends with specified terminals. |
static RVertexSet |
C3PartUtil.getSons(Vertex V)
get multinodes sons of a multinode V and create an empty RVertexSet if it does not exist. |
static RColorSet |
C3PartUtil.getTrueColors(Vertex V,
Vertex U)
compute true colors of edge (U, V) using the datagraph (i.e not relying on an actual edge). |
static boolean |
C3PartUtil.hasAlias(Vertex V)
tell if multinode V has aliases i.e. |
static boolean |
C3PartUtil.hasRoot(Vertex V)
tell if multinode V has a root node i.e. |
static boolean |
C3PartUtil.hasSon(Vertex V)
tell if multinode V has son(s) |
static boolean |
C3PartUtil.isCoreNode(Vertex V)
tell if multinode V has no star. |
static boolean |
C3PartUtil.isFullStar(Vertex V)
tell if multinode V is a full star (also called the 'black' star) i.e if all of its datanodes are stars |
static boolean |
C3PartUtil.isPartialStar(Vertex V)
tell if multinode V is a partial star on at least one color but not a full star |
static boolean |
C3PartUtil.isStar(Vertex v)
tell if datanode v is a star (*) note: there are different ways to detect '*' the quickest for now is that '*' is (should be) the only colorless datanode |
static void |
MultiGraphDebugger.printNode(Vertex V,
String prefix,
boolean aliasToo)
print node |
static void |
C3PartUtil.removeAlias(Vertex V,
Vertex Alias)
remove alias from multinode |
static void |
C3PartUtil.removeAliases(Vertex V)
remove all aliases from multinode V (also remove root from Aliases(V)) |
static void |
C3PartUtil.removeMultinode(Vertex v)
remove multinode V from datanode v |
static void |
C3PartUtil.removeRoot(Vertex V)
remove root from multinode V (and remove V from its root aliases) |
static void |
C3PartUtil.removeSons(Vertex V)
remove all sons from multinode V |
static void |
C3PartUtil.setMultinode(Vertex v,
Vertex V)
record in datanode v the multinode V such that Nodes(V) = (v). |
static void |
C3PartUtil.setRoot(Vertex V,
Vertex Root)
record Root multinode in multinode V (also add V in Aliases(Root)) |
Method parameters in helix.graph.algo.c3part with type arguments of type Vertex | |
---|---|
static void |
C3PartUtil.removeAliases(Iterable<Vertex> iterable)
|
static void |
C3PartUtil.removeRoot(Iterable<Vertex> iterable)
|
static void |
C3PartUtil.removeSons(Iterable<Vertex> iterable)
|
Uses of Vertex in helix.graph.algo.c3part.aggregator |
---|
Methods in helix.graph.algo.c3part.aggregator that return types with arguments of type Vertex | |
---|---|
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). |
Methods in helix.graph.algo.c3part.aggregator with parameters of type Vertex | |
---|---|
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). |
abstract boolean |
NodeAggregator.isAggregable(Vertex V,
Vertex v)
Check if datagraph node 'v' can be aggregated to multigraph vertex V. |
boolean |
DenseCCAggregator.isAggregable(Vertex V,
Vertex v)
override isAggregable to add the density condition |
boolean |
CliqueAggregator.isAggregable(Vertex V,
Vertex v)
Check if datagraph node 'v' forms an epsilon clique with all elements in Nodes(V) note: star ghost is considered having epsilon links with any vertex (including itself) note: since Nodes(V) already forms a clique, we just have to check that v is epsilon connected to each element |
boolean |
CenteredAggregator.isAggregable(Vertex V,
Vertex v)
Check if datagraph node 'v' forms an epsilon star with the first element in Nodes(V), considered as the pivot |
boolean |
CCAggregator.isAggregable(Vertex V,
Vertex v)
|
Uses of Vertex in helix.graph.algo.c3part.compressor |
---|
Methods in helix.graph.algo.c3part.compressor that return Vertex | |
---|---|
Vertex |
NoCompressor.getRoot(Vertex V)
|
Vertex |
GraphCompressor.getRoot(Vertex v)
get root of a compressed vertex |
Vertex |
AbstractCompressor.getRoot(Vertex v)
get root of a compressed vertex |
Methods in helix.graph.algo.c3part.compressor that return types with arguments of type Vertex | |
---|---|
Iterable<Vertex> |
NoCompressor.getAliases(Vertex V)
|
Iterable<Vertex> |
GraphCompressor.getAliases(Vertex v)
get aliases of root vertex return empty set if v is not root |
Iterable<Vertex> |
AbstractCompressor.getAliases(Vertex v)
get aliases of root vertex |
Iterable<Vertex> |
NoCompressor.getNeighbors(Vertex v)
|
Iterable<Vertex> |
GraphCompressor.getNeighbors(Vertex v)
return neighbors of vertex v, including aliases of neighbors |
Iterable<Vertex> |
AbstractCompressor.getNeighbors(Vertex v)
return neighbors of vertex v, including aliases of neighbors |
Iterable<Vertex> |
NoCompressor.getVertices(Graph graph)
|
Iterable<Vertex> |
GraphCompressor.getVertices(Graph graph)
return all vertices in compressed graph. |
Iterable<Vertex> |
AbstractCompressor.getVertices(Graph graph)
return all vertices in compressed graph. |
Iterable<Vertex> |
MultiInSetCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
Iterable<Vertex> |
MultiInSetColorsCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
Iterable<Vertex> |
MultiInColorsCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
Iterable<Vertex> |
MultiIdentCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
abstract Iterable<Vertex> |
AbstractMultiCompressor.patternSet_(Vertex V,
Graph multi)
delegate pattern set |
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 Vertex | |
---|---|
void |
NoCompressor.compressVertex(Vertex v,
Vertex root,
Graph graph)
|
void |
MultiInSetCompressor.compressVertex(Vertex V,
Vertex Root,
Graph multi)
|
void |
GraphCompressor.compressVertex(Vertex v,
Vertex root,
Graph graph)
compress single vertex v on root vertex |
void |
AbstractCompressor.compressVertex(Vertex v,
Vertex root,
Graph graph)
compress single vertex v on root vertex root |
void |
NoCompressor.expandVertex(Vertex v,
Graph graph)
|
void |
MultiInSetCompressor.expandVertex(Vertex V,
Graph multi)
expand single vertex and recompute root colors |
void |
GraphCompressor.expandVertex(Vertex v,
Graph graph)
restore compressed alias vertex v to its initial state |
void |
AbstractMultiCompressor.expandVertex(Vertex V,
Graph multi)
restore compressed vertex v to its initial state |
Iterable<Vertex> |
NoCompressor.getAliases(Vertex V)
|
Iterable<Vertex> |
GraphCompressor.getAliases(Vertex v)
get aliases of root vertex return empty set if v is not root |
Iterable<Vertex> |
AbstractCompressor.getAliases(Vertex v)
get aliases of root vertex |
RColorSet |
NoCompressor.getColors(Vertex V,
Vertex U)
|
RColorSet |
MultiInSetCompressor.getColors(Vertex V,
Vertex U)
override getColors get proper color between two vertices if there is a physical edge return this color else compute pseudocolors. |
RColorSet |
MultiGraphCompressor.getColors(Vertex v,
Vertex u)
get proper colors of edge (v, u). |
RColorSet |
AbstractMultiCompressor.getColors(Vertex V,
Vertex U)
Get color of edge (V,U) if it exists, else compute the colors it should have according to this compressor. |
Iterable<Vertex> |
NoCompressor.getNeighbors(Vertex v)
|
Iterable<Vertex> |
GraphCompressor.getNeighbors(Vertex v)
return neighbors of vertex v, including aliases of neighbors |
Iterable<Vertex> |
AbstractCompressor.getNeighbors(Vertex v)
return neighbors of vertex v, including aliases of neighbors |
Vertex |
NoCompressor.getRoot(Vertex V)
|
Vertex |
GraphCompressor.getRoot(Vertex v)
get root of a compressed vertex |
Vertex |
AbstractCompressor.getRoot(Vertex v)
get root of a compressed vertex |
boolean |
NoCompressor.isAlias(Vertex V)
|
boolean |
GraphCompressor.isAlias(Vertex v)
tell if vertex is an Alias vertex. |
boolean |
AbstractCompressor.isAlias(Vertex v)
tell if vertex is an Alias (i.e. |
boolean |
NoCompressor.isNormal(Vertex V)
|
boolean |
GraphCompressor.isNormal(Vertex v)
tell if vertex is a normal vertex. |
boolean |
AbstractCompressor.isNormal(Vertex v)
tell if vertex is a normal vertex. |
boolean |
NoCompressor.isRoot(Vertex V)
|
boolean |
GraphCompressor.isRoot(Vertex v)
tell if vertex is a root vertex. |
boolean |
AbstractCompressor.isRoot(Vertex v)
tell if vertex is a root vertex. |
Iterable<Vertex> |
MultiInSetCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
Iterable<Vertex> |
MultiInSetColorsCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
Iterable<Vertex> |
MultiInColorsCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
Iterable<Vertex> |
MultiIdentCompressor.patternSet_(Vertex V,
Graph multi)
delegate patternSet |
abstract Iterable<Vertex> |
AbstractMultiCompressor.patternSet_(Vertex V,
Graph multi)
delegate pattern set |
void |
MultiInSetCompressor.restoreEdge_(Vertex V,
Vertex W,
Vertex Root,
Graph multi)
delegate restoration restore (if needed) edge between V and W |
void |
MultiInSetColorsCompressor.restoreEdge_(Vertex V,
Vertex W,
Vertex Root,
Graph multi)
delegate restoration restore (if needed) edge between V and W |
void |
MultiInColorsCompressor.restoreEdge_(Vertex V,
Vertex W,
Vertex Root,
Graph multi)
delegate restoration restore (if needed) edge between V and W |
void |
MultiIdentCompressor.restoreEdge_(Vertex V,
Vertex W,
Vertex Root,
Graph multi)
delegate restoration restore (if needed) edge between V and W |
abstract void |
AbstractMultiCompressor.restoreEdge_(Vertex V,
Vertex W,
Vertex Root,
Graph multi)
delegate edge restoration restore (if needed) edge between V and W |
boolean |
MultiInSetCompressor.subsumes_(Vertex V,
Vertex U,
Graph graph)
delegate subsumption |
boolean |
MultiInSetColorsCompressor.subsumes_(Vertex V,
Vertex U,
Graph graph)
delegate subsumption |
boolean |
MultiInColorsCompressor.subsumes_(Vertex V,
Vertex U,
Graph graph)
delegate subsumption |
boolean |
MultiIdentCompressor.subsumes_(Vertex V,
Vertex U,
Graph multi)
delegate subsumption |
abstract boolean |
AbstractMultiCompressor.subsumes_(Vertex V,
Vertex U,
Graph multi)
delegate subsumption |
boolean |
NoCompressor.subsumes(Vertex v,
Vertex u,
Graph graph)
|
boolean |
GraphCompressor.subsumes(Vertex v,
Vertex u,
Graph graph)
tells if vertex v subsumes vertex u |
boolean |
AbstractMultiCompressor.subsumes(Vertex V,
Vertex U,
Graph multi)
tells if vertex V subsumes vertex U |
Method parameters in helix.graph.algo.c3part.compressor with type arguments of type Vertex | |
---|---|
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 Vertex in helix.graph.algo.c3part.lookahead |
---|
Methods in helix.graph.algo.c3part.lookahead that return types with arguments of type Vertex | |
---|---|
GSet<Vertex> |
LookaheadConnector.getLookahead(Graph datagraph,
Graph multigraph,
int color)
get the pseudoterminals and return a new GSet[Vertex] |
Method parameters in helix.graph.algo.c3part.lookahead with type arguments of type Vertex | |
---|---|
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 Vertex in helix.graph.algo.c3part.visitor |
---|
Methods in helix.graph.algo.c3part.visitor that return types with arguments of type Vertex | |
---|---|
Iterable<GSet<Vertex>> |
CCSuperStarByColorVisitor.getComponents()
|
Iterable<GSet<Vertex>> |
CCStarByColorVisitor.getComponents()
|
Methods in helix.graph.algo.c3part.visitor with parameters of type Vertex | |
---|---|
void |
CCStarByColorVisitor.visit(Vertex V)
|
Constructors in helix.graph.algo.c3part.visitor with parameters of type Vertex | |
---|---|
CCStarByColorVisitor(Graph multigraph,
int color,
int colorIndex,
Vertex star)
|
|
CCSuperStarByColorVisitor(Graph multigraph,
int color,
int colorIndex,
Vertex star)
|
Uses of Vertex in helix.graph.model |
---|
Methods in helix.graph.model that return Vertex | |
---|---|
Vertex |
EdgeToVertexIterator.adapt(Edge e)
|
Vertex |
Graph.addVertex()
|
Vertex |
Graph.findVertex(String registryKey,
Object anyValue)
|
Vertex |
Graph.findVertex(String registryKey,
RegistryValue registryValue)
|
Vertex |
Edge.getVertexTo(Vertex v)
|
Vertex[] |
Edge.toArray()
|
Vertex |
Edge.v1()
|
Vertex |
Edge.v2()
|
Methods in helix.graph.model that return types with arguments of type Vertex | |
---|---|
GSet<Vertex> |
Graph.findVertices(String registryKey,
Object anyValue)
|
GSet<Vertex> |
Graph.findVertices(String registryKey,
RegistryValue registryValue)
|
Iterator<Vertex> |
EdgeToVertexIterable.iterator()
|
Iterable<Vertex> |
Vertex.neighbors()
get Iterable over all vertices that are adjacent to this vertex note: the following codes are equivalent :
for (Vertex w : v.neighbors())
and :
for (Edge e : v.edges()) { |
GSetFactory<Vertex> |
Graph.vertexSetFactory()
|
Iterable<Vertex> |
Graph.vertices()
|
Methods in helix.graph.model with parameters of type Vertex | |
---|---|
Edge |
Graph.addEdge(Vertex v1,
Vertex v2)
|
void |
Graph.addPhysicalVertex(Vertex v)
|
Edge |
Graph.assertEdge(Vertex v1,
Vertex v2)
|
void |
Graph.disconnectVertex(Vertex v)
|
Edge |
Graph.getEdge(Vertex v1,
Vertex v2)
|
Edge |
Vertex.getEdgeTo(Vertex v)
get the edge between this vertex and destination vertex v (if it exists) |
Vertex |
Edge.getVertexTo(Vertex v)
|
boolean |
Graph.hasEdge(Vertex v1,
Vertex v2)
|
boolean |
Vertex.hasEdgeTo(Vertex v)
tells if there is an edge between this vertex and destination vertex v (if it exists). |
boolean |
Graph.hasVertex(Vertex v)
|
boolean |
Edge.hasVertex(Vertex v)
|
void |
Graph.removeEdge(Vertex v1,
Vertex v2)
|
void |
Graph.removeVertex(Vertex v)
|
Method parameters in helix.graph.model with type arguments of type Vertex | |
---|---|
Set<Graph> |
Graph.physicalSplit(Iterable<GSet<Vertex>> splits)
|
Constructors in helix.graph.model with parameters of type Vertex | |
---|---|
EdgeToVertexIterable(Iterable<Edge> iterable,
Vertex origin)
|
|
EdgeToVertexIterator(Iterator<Edge> iterator,
Vertex origin)
|
Uses of Vertex in helix.graph.model.impl |
---|
Methods in helix.graph.model.impl that return Vertex | |
---|---|
Vertex |
AbstractGraph.findVertex(String registryKey,
Object anyValue)
|
Vertex |
AbstractGraph.findVertex(String registryKey,
RegistryValue registryValue)
|
Vertex |
RVertex.get()
|
Vertex |
RVertexList.getVertex(int index)
|
Vertex |
RVertexArray.getVertex(int index)
|
Vertex |
RVertexList.lastVertex()
|
Vertex |
RVertexList.removeVertex(int index)
|
Vertex |
RVertex.set(Vertex v)
|
Vertex |
RVertexList.setVertex(int index,
Vertex v)
|
Vertex |
RVertexArray.setVertex(int index,
Vertex v)
|
Methods in helix.graph.model.impl that return types with arguments of type Vertex | |
---|---|
GSet<Vertex> |
AbstractGraph.findVertices(String registryKey,
Object anyValue)
|
GSet<Vertex> |
AbstractGraph.findVertices(String registryKey,
RegistryValue registryValue)
|
Iterator<Vertex> |
RVertexSet.iterator()
|
Iterator<Vertex> |
RVertexList.iterator()
|
Iterable<Vertex> |
AbstractGraph.vertices()
|
Methods in helix.graph.model.impl with parameters of type Vertex | |
---|---|
void |
AbstractGraph.addPhysicalVertex(Vertex v)
TODO a documenter serieusement |
void |
RVertexSet.addVertex(Vertex v)
|
void |
RVertexList.addVertex(Vertex v)
|
Edge |
AbstractGraph.assertEdge(Vertex v1,
Vertex v2)
|
void |
AbstractGraph.disconnectVertex(Vertex v)
|
Edge |
AbstractGraph.getEdge(Vertex v1,
Vertex v2)
|
boolean |
AbstractGraph.hasEdge(Vertex v1,
Vertex v2)
|
boolean |
RVertexSet.hasVertex(Vertex v)
|
boolean |
AbstractGraph.hasVertex(Vertex v)
|
void |
RVertexSet.removeVertex(Vertex v)
|
void |
AbstractGraph.removeVertex(Vertex v)
|
Vertex |
RVertex.set(Vertex v)
|
Vertex |
RVertexList.setVertex(int index,
Vertex v)
|
Vertex |
RVertexArray.setVertex(int index,
Vertex v)
|
Method parameters in helix.graph.model.impl with type arguments of type Vertex | |
---|---|
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 |
Constructors in helix.graph.model.impl with parameters of type Vertex | |
---|---|
RVertex(Vertex v)
|
|
RVertexList(Vertex v)
|
|
RVertexSet(Vertex v)
|
Constructor parameters in helix.graph.model.impl with type arguments of type Vertex | |
---|---|
RVertexList(Collection<Vertex> c)
|
|
RVertexSet(Collection<Vertex> c)
|
Uses of Vertex in helix.graph.model.impl.memory |
---|
Classes in helix.graph.model.impl.memory that implement Vertex | |
---|---|
class |
MemVertex
|
Methods in helix.graph.model.impl.memory that return Vertex | |
---|---|
Vertex |
MemGraph.addVertex()
|
Vertex |
MemEdge.getVertexTo(Vertex v)
|
Vertex[] |
MemEdge.toArray()
|
Vertex |
MemEdge.v1()
|
Vertex |
MemEdge.v2()
|
Methods in helix.graph.model.impl.memory that return types with arguments of type Vertex | |
---|---|
Iterable<Vertex> |
MemVertex.neighbors()
|
GSetFactory<Vertex> |
MemGraph.vertexSetFactory()
|
Methods in helix.graph.model.impl.memory with parameters of type Vertex | |
---|---|
Edge |
MemGraph.addEdge(Vertex v1,
Vertex v2)
|
Edge |
MemVertex.getEdgeTo(Vertex v)
|
Vertex |
MemEdge.getVertexTo(Vertex v)
|
boolean |
MemVertex.hasEdgeTo(Vertex v)
|
boolean |
MemEdge.hasVertex(Vertex v)
|
void |
MemGraph.removeEdge(Vertex v1,
Vertex v2)
|
Uses of Vertex in helix.graph.util |
---|
Methods in helix.graph.util that return Vertex | |
---|---|
Vertex |
GraphDebugger.checkIntegrity(Graph g,
String header)
|
Methods in helix.graph.util with parameters of type Vertex | |
---|---|
void |
GraphDebugger.log(Vertex v)
print one vertex |
Method parameters in helix.graph.util with type arguments of type Vertex | |
---|---|
void |
GraphDebugger.log(GSet<Vertex> set)
|
void |
GraphDebugger.log(GSet<Vertex> set,
String header)
print set of vertices |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |