|
GraphLab Project | |||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of BaseVertex in graphlab.extensions.reports |
---|
Fields in graphlab.extensions.reports declared as BaseVertex | |
---|---|
BaseVertex[] |
Partitioner.vertices
|
Methods in graphlab.extensions.reports that return types with arguments of type BaseVertex | |
---|---|
static java.util.Vector<java.util.ArrayDeque<BaseVertex>> |
MaxIndependentSetReport.getMaxIndependentSet(GraphModel graph)
|
Method parameters in graphlab.extensions.reports with type arguments of type BaseVertex | |
---|---|
boolean |
Partitioner.findAllPartitioningsRecursively(int tt,
ColoringListener listener,
java.util.ArrayDeque<BaseVertex> v)
|
boolean |
SubSetListener.subsetFound(int t,
java.util.ArrayDeque<BaseVertex> complement,
java.util.ArrayDeque<BaseVertex> set)
|
boolean |
SubSetListener.subsetFound(int t,
java.util.ArrayDeque<BaseVertex> complement,
java.util.ArrayDeque<BaseVertex> set)
|
Uses of BaseVertex in graphlab.graph.graph |
---|
Subclasses of BaseVertex in graphlab.graph.graph | |
---|---|
class |
VertexModel
Authors: Azin Azadi,Roozbeh |
Uses of BaseVertex in graphlab.library |
---|
Classes in graphlab.library with type parameters of type BaseVertex | |
---|---|
class |
BaseEdge<VertexType extends BaseVertex>
The base class for all edges. |
class |
BaseGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Generic base class for representation of all types of graphs. |
class |
Cycle<VertexType extends BaseVertex>
I think this is enough for a path; |
class |
ListGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Adjacency List Graph. |
class |
MatrixGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Adjacency Matrix Graph. |
class |
Path<VertexType extends BaseVertex>
I think this is enough for a path; |
Fields in graphlab.library declared as BaseVertex | |
---|---|
VertexType |
BaseEdge.source
|
VertexType |
BaseEdge.target
|
Methods in graphlab.library that return BaseVertex | |
---|---|
BaseVertex |
BaseVertex.getCopy()
|
BaseVertex[] |
ListGraph.getVertexArray()
|
abstract BaseVertex[] |
BaseGraph.getVertexArray()
Returns array of vertices upcasted to BaseVertex. |
BaseVertex[] |
MatrixGraph.getVertexArray()
|
Uses of BaseVertex in graphlab.library.algorithms.coloring |
---|
Classes in graphlab.library.algorithms.coloring with type parameters of type BaseVertex | |
---|---|
class |
SampleColoring<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseVertex in graphlab.library.algorithms.goperators |
---|
Methods in graphlab.library.algorithms.goperators with type parameters of type BaseVertex | ||
---|---|---|
static
|
GraphComplement.complement(BaseGraph<VertexType,EdgeType> g1)
|
|
static
|
EdgeInduced.edgeInduced(BaseGraph<VertexType,EdgeType> g,
java.util.Collection<EdgeType> S)
|
|
static
|
VertexInduced.induced(BaseGraph<VertexType,EdgeType> g,
java.util.Collection<VertexType> S)
|
|
static
|
GraphUnion.union(BaseGraph<VertexType,EdgeType> g1,
BaseGraph<VertexType,EdgeType> g2)
|
Uses of BaseVertex in graphlab.library.algorithms.goperators.product |
---|
Classes in graphlab.library.algorithms.goperators.product with type parameters of type BaseVertex | |
---|---|
class |
GProduct<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
|
Methods in graphlab.library.algorithms.goperators.product with parameters of type BaseVertex | |
---|---|
boolean |
GCartesianProduct.compare(BaseVertex v1OfFirstG,
BaseVertex v2OfFirstG,
BaseVertex v1OfSecondG,
BaseVertex v2OfSecondG)
|
boolean |
GPopularProduct.compare(BaseVertex v1OfFirstG,
BaseVertex v2OfFirstG,
BaseVertex v1OfSecondG,
BaseVertex v2OfSecondG)
|
Uses of BaseVertex in graphlab.library.algorithms.graphdecomposition |
---|
Classes in graphlab.library.algorithms.graphdecomposition with type parameters of type BaseVertex | |
---|---|
class |
BiconnectedComponents<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
This Method find the biconnected components of a graph. |
Uses of BaseVertex in graphlab.library.algorithms.homomorphism |
---|
Classes in graphlab.library.algorithms.homomorphism with type parameters of type BaseVertex | |
---|---|
class |
Homomorphism<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseVertex in graphlab.library.algorithms.shortestpath |
---|
Uses of BaseVertex in graphlab.library.algorithms.sorting |
---|
Methods in graphlab.library.algorithms.sorting with type parameters of type BaseVertex | ||
---|---|---|
static
|
TopologicalSort.doSort(BaseGraph<VertexType,EdgeType> graph)
|
Uses of BaseVertex in graphlab.library.algorithms.spanningtree |
---|
Classes in graphlab.library.algorithms.spanningtree with type parameters of type BaseVertex | |
---|---|
class |
Prim<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Implementation of Prim algorithm to find minimum spanning tree. |
Methods in graphlab.library.algorithms.spanningtree with type parameters of type BaseVertex | ||
---|---|---|
static
|
Kruskal.findMinimumSpanningTree(BaseGraph<VertexType,EdgeType> graph)
|
Uses of BaseVertex in graphlab.library.algorithms.subgraphs |
---|
Methods in graphlab.library.algorithms.subgraphs with type parameters of type BaseVertex | ||
---|---|---|
static
|
InducedSubgraphs.getEdgeInducedSubgraph(BaseGraph<VertexType,EdgeType> graph,
java.util.AbstractList<EdgeType> inducedEdges)
|
|
static
|
InducedSubgraphs.getVertexInducedSubgraph(BaseGraph<VertexType,EdgeType> graph,
java.util.AbstractList<VertexType> inducedVertices)
|
Uses of BaseVertex in graphlab.library.algorithms.traversal |
---|
Classes in graphlab.library.algorithms.traversal with type parameters of type BaseVertex | |
---|---|
class |
BreadthFirstSearch<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Description here. |
class |
DepthFirstSearch<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseVertex in graphlab.library.algorithms.util |
---|
Methods in graphlab.library.algorithms.util with type parameters of type BaseVertex | ||
---|---|---|
static
|
LibraryUtils.complement(BaseGraph<VertexType,EdgeType> g1)
|
|
static
|
LibraryUtils.edgeInduced(BaseGraph<VertexType,EdgeType> g,
java.util.Collection<EdgeType> S)
|
|
static
|
LibraryUtils.falsifyEdgeMarks(BaseGraph<VertexType,EdgeType> g)
|
|
static
|
LibraryUtils.falsifyVertexMarks(BaseGraph<VertexType,EdgeType> g)
|
|
static
|
LibraryUtils.getVertexMarks(BaseGraph<VertexType,EdgeType> g)
returns all vertex marks in a array |
|
static
|
LibraryUtils.induced(BaseGraph<VertexType,EdgeType> g,
java.util.Collection<VertexType> S)
|
|
static
|
AcyclicChecker.isGraphAcyclic(BaseGraph<VertexType,EdgeType> graph)
Checks whether the current graph is acyclic. |
|
static
|
ConnectivityChecker.isGraphConnected(BaseGraph<VertexType,EdgeType> graph)
Checks whether the current graph is a connected graph. |
|
static
|
LibraryUtils.join(BaseGraph<VertexType,EdgeType> g1,
BaseGraph<VertexType,EdgeType> g2)
|
|
static
|
LibraryUtils.setVertexMarks(BaseGraph<VertexType,EdgeType> g,
boolean[] verexMarks)
sets all the vertex marks |
Uses of BaseVertex in graphlab.library.algorithms.vertexcover |
---|
Classes in graphlab.library.algorithms.vertexcover with type parameters of type BaseVertex | |
---|---|
class |
AppVertexCover<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseVertex in graphlab.library.event |
---|
Fields in graphlab.library.event declared as BaseVertex | |
---|---|
VertexType |
PreWorkEvent.from
|
VertexType |
PostWorkEvent.from
|
VertexType |
PreWorkEvent.to
|
VertexType |
PostWorkEvent.to
|
VertexType |
VertexEdgeLabelEvent.v
|
VertexType |
VertexEvent.vertex
|
Uses of BaseVertex in graphlab.library.event.handlers |
---|
Classes in graphlab.library.event.handlers with type parameters of type BaseVertex | |
---|---|
interface |
PostWorkHandler<VertexType extends BaseVertex>
Handles postwork used by algorithms such as BFS. |
interface |
PreWorkHandler<VertexType extends BaseVertex>
Handles prework used by algorithms such as BFS and DFS. |
interface |
PreWorkPostWorkHandler<VertexType extends BaseVertex>
Handles both prework and postwork used by algorithms such as DFS and BFS. |
Uses of BaseVertex in graphlab.library.event.typedef |
---|
Constructors in graphlab.library.event.typedef with parameters of type BaseVertex | |
---|---|
BaseVertexEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseVertex vertex)
|
|
BaseVertexEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseVertex vertex,
VertexEvent.EventType et)
|
Uses of BaseVertex in graphlab.library.genericcloners |
---|
Methods in graphlab.library.genericcloners that return BaseVertex | |
---|---|
BaseVertex |
BaseEdgeVertexCopier.convert(BaseVertex e)
|
Methods in graphlab.library.genericcloners that return types with arguments of type BaseVertex | |
---|---|
BaseEdge<BaseVertex> |
BaseEdgeVertexCopier.convert(BaseEdge<BaseVertex> e,
BaseVertex newSource,
BaseVertex newTarget)
|
Methods in graphlab.library.genericcloners with parameters of type BaseVertex | |
---|---|
BaseEdge<BaseVertex> |
BaseEdgeVertexCopier.convert(BaseEdge<BaseVertex> e,
BaseVertex newSource,
BaseVertex newTarget)
|
BaseVertex |
BaseEdgeVertexCopier.convert(BaseVertex e)
|
Method parameters in graphlab.library.genericcloners with type arguments of type BaseVertex | |
---|---|
BaseEdge<BaseVertex> |
BaseEdgeVertexCopier.convert(BaseEdge<BaseVertex> e,
BaseVertex newSource,
BaseVertex newTarget)
|
Uses of BaseVertex in graphlab.library.test |
---|
Methods in graphlab.library.test with type parameters of type BaseVertex | ||
---|---|---|
static
|
TestListGraph.setRandomWeights(BaseGraph<VertexType,EdgeType> graph,
int limit)
|
Methods in graphlab.library.test that return types with arguments of type BaseVertex | |
---|---|
static ListGraph<BaseVertex,BaseEdge<BaseVertex>> |
TestListGraph.generateRandomListGraph(int vertexCount,
int edgeCount)
|
static ListGraph<BaseVertex,BaseEdge<BaseVertex>> |
TestListGraph.generateRandomListGraph(int vertexCount,
int edgeCount)
|
Method parameters in graphlab.library.test with type arguments of type BaseVertex | |
---|---|
int |
TestListGraph.BaseEdgeWeightComparator.compare(BaseEdge<BaseVertex> o1,
BaseEdge<BaseVertex> o2)
|
int |
TestListGraph.BaseEdgeWeightComparator.compare(BaseEdge<BaseVertex> o1,
BaseEdge<BaseVertex> o2)
|
int |
TestMatrixGraph.BaseEdgeWeightComparator.compare(BaseEdge<BaseVertex> o1,
BaseEdge<BaseVertex> o2)
|
int |
TestMatrixGraph.BaseEdgeWeightComparator.compare(BaseEdge<BaseVertex> o1,
BaseEdge<BaseVertex> o2)
|
Constructors in graphlab.library.test with parameters of type BaseVertex | |
---|---|
TestNewEdge(BaseVertex source,
BaseVertex target)
|
Uses of BaseVertex in graphlab.plugins.main.core |
---|
Classes in graphlab.plugins.main.core with type parameters of type BaseVertex | |
---|---|
static interface |
AlgorithmUtils.BFSListener<Vertex extends BaseVertex>
|
Methods in graphlab.plugins.main.core with type parameters of type BaseVertex | ||
---|---|---|
static
|
AlgorithmUtils.BFS(BaseGraph<Vertex,Edge> unRootedTree,
AlgorithmUtils.BFSListener<Vertex> listener)
performs a full BFS on graph, it selects the vertices with minimum degrees as the roots of the resulting forest |
|
static
|
AlgorithmUtils.BFS(BaseGraph<Vertex,Edge> unRootedTree,
Vertex treeRoot,
AlgorithmUtils.BFSListener<Vertex> listener)
performs a bfs on the given root, this method changes vertex marks, and also marked vertices will not be traversed |
|
static
|
AlgorithmUtils.BFSOrder(BaseGraph<Vertex,Edge> unRootedTree,
Vertex treeRoot)
gets the vertices in the order of AlgorithmUtils.getSubTree() |
|
static
|
AlgorithmUtils.BFSrun(BaseGraph<Vertex,Edge> unRootedTree,
Vertex treeRoot,
AlgorithmUtils.BFSListener<Vertex> listener)
runs a BFS on graph, starting the given vertex as the root |
|
static
|
AlgorithmUtils.clearVertexMarks(BaseGraph<VertexType,EdgeType> g)
clears all vertex marks |
|
static
|
AlgorithmUtils.dfs(BaseGraph<VertexType,EdgeType> g,
int node,
java.util.ArrayList visit,
int[] parent)
runs a dfs and fills visit and parent, visit is the visiting order of vertices and parent[i] is the id of i'th vertex parent |
|
static
|
AlgorithmUtils.getAdjList(BaseGraph<VertexType,EdgeType> g)
Deprecated. use BaseGraph.getEdgeArray instead |
|
static
|
AlgorithmUtils.getDegree(BaseGraph<VertexType,EdgeType> bg,
int node)
Deprecated. |
|
static
|
AlgorithmUtils.getDegreesList(BaseGraph<VertexType,EdgeType> g)
returns the vertex degrees as a list, sorted by vertex ids |
|
static
|
AlgorithmUtils.getNeighbors(BaseGraph<VertexType,EdgeType> g,
VertexType source)
Deprecated. |
|
static
|
AlgorithmUtils.getNeighbors2(BaseGraph<VertexType,EdgeType> g,
VertexType source)
Deprecated. |
|
static
|
AlgorithmUtils.getParent(BaseGraph<VertexType,EdgeType> g,
VertexType treeRoot,
VertexType v)
returns the parent of v, if ve DFS on parent |
|
static
|
AlgorithmUtils.getPath(BaseGraph<VertexType,EdgeType> g,
VertexType source,
VertexType dest)
returns a path from source to target path.get(0) = dest |
|
static
|
AlgorithmUtils.getRoot(BaseGraph<Vertex,Edge> g,
Vertex v)
returns the root which is assigned to each vertex it is the minimum id vertex in the corresponding component of vertex |
|
static
|
AlgorithmUtils.getSubTree(BaseGraph<Vertex,Edge> tree,
Vertex treeRoot,
Vertex subTreeRoot)
returns the subtree rooted by subTreeRoot in the rooted tree tree with the root treeRoot the vertices are ordered by their distances to subTreeRoot the exact distance is placed in v.getProp().obj as an Integer, starting distance is 0 which is subTreeRoot |
|
static
|
AlgorithmUtils.isCompleteGraph(BaseGraph<VertexType,EdgeType> g)
determines wether g is complete or not |
|
static
|
AlgorithmUtils.isConnected(BaseGraph<VertexType,EdgeType> g)
determines wether g is connected or not |
Methods in graphlab.plugins.main.core with parameters of type BaseVertex | |
---|---|
static int |
AlgorithmUtils.getTotalDegree(BaseGraph g,
BaseVertex v)
retunrs the degree of vertex (indegree + outdegree) |
Method parameters in graphlab.plugins.main.core with type arguments of type BaseVertex | |
---|---|
static void |
AlgorithmUtils.resetVertexColors(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> g)
sets all vertex colors to 0. |
static void |
AlgorithmUtils.resetVertexColors(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> g)
sets all vertex colors to 0. |
static void |
AlgorithmUtils.resetVertexMarks(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> g)
sets all vertex marks to false |
static void |
AlgorithmUtils.resetVertexMarks(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> g)
sets all vertex marks to false |
Uses of BaseVertex in graphlab.plugins.main.saveload.matrix |
---|
Methods in graphlab.plugins.main.saveload.matrix with type parameters of type BaseVertex | ||
---|---|---|
static
|
Matrix.graph2Matrix(BaseGraph<vt,et> g)
|
|
GraphLab Project | |||||||||
PREV NEXT | FRAMES NO FRAMES |