|
GraphLab Project | |||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of BaseGraph in graphlab.extensions.reports |
---|
Methods in graphlab.extensions.reports with parameters of type BaseGraph | |
---|---|
boolean |
Partitioner.checkColoring(BaseGraph g)
|
Constructors in graphlab.extensions.reports with parameters of type BaseGraph | |
---|---|
Partitioner(BaseGraph g)
|
Uses of BaseGraph in graphlab.graph.graph |
---|
Subclasses of BaseGraph in graphlab.graph.graph | |
---|---|
class |
GraphModel
|
Uses of BaseGraph in graphlab.library |
---|
Subclasses of BaseGraph in graphlab.library | |
---|---|
class |
ListGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Adjacency List Graph. |
class |
MatrixGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Adjacency Matrix Graph. |
Fields in graphlab.library declared as BaseGraph | |
---|---|
protected BaseGraph<VertexType,EdgeType> |
BaseGraph.superGraph
|
Methods in graphlab.library with type parameters of type BaseGraph | ||
---|---|---|
abstract
|
BaseGraph.createEmptyGraph()
Returns a new instance of an empty graph of the current graph type. |
Methods in graphlab.library that return BaseGraph | |
---|---|
BaseGraph<VertexType,EdgeType> |
ListGraph.copy(EdgeVertexCopier<VertexType,EdgeType> gc)
|
abstract BaseGraph<VertexType,EdgeType> |
BaseGraph.copy(EdgeVertexCopier<VertexType,EdgeType> gc)
Creates a clone of the current graph using the GraphConverter object which is responsible for duplication of the graph elements (edges and vertices). |
BaseGraph<VertexType,EdgeType> |
MatrixGraph.copy(EdgeVertexCopier<VertexType,EdgeType> gc)
|
Methods in graphlab.library with parameters of type BaseGraph | |
---|---|
void |
BaseGraph.registerSubgraph(BaseGraph<VertexType,EdgeType> superGraph)
Sets the graph as a subgraph. |
Constructors in graphlab.library with parameters of type BaseGraph | |
---|---|
ListGraph(BaseGraph<ImportVertexType,ImportEdgeType> graph,
GraphConverter<ImportVertexType,VertexType,ImportEdgeType,EdgeType,ImportGraphType,ListGraph<VertexType,EdgeType>> converter)
Constructs a graph object that stores graph data using adjacency list data structure by importing graph data from a pre-existing graph. |
|
MatrixGraph(BaseGraph<ImportVertexType,ImportEdgeType> graph,
GraphConverter<ImportVertexType,VertexType,ImportEdgeType,EdgeType,ImportGraphType,MatrixGraph<VertexType,EdgeType>> gc)
Constructs a graph object that stores graph data using adjacency matrix data structure by importing graph data from a pre-existing graph. |
Uses of BaseGraph in graphlab.library.algorithms.coloring |
---|
Constructors in graphlab.library.algorithms.coloring with parameters of type BaseGraph | |
---|---|
SampleColoring(BaseGraph<VertexType,EdgeType> g)
|
Uses of BaseGraph in graphlab.library.algorithms.goperators |
---|
Methods in graphlab.library.algorithms.goperators that return BaseGraph | ||
---|---|---|
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)
|
Methods in graphlab.library.algorithms.goperators with parameters of type BaseGraph | ||
---|---|---|
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)
|
|
static
|
GraphUnion.union(BaseGraph<VertexType,EdgeType> g1,
BaseGraph<VertexType,EdgeType> g2)
|
Uses of BaseGraph in graphlab.library.algorithms.goperators.product |
---|
Classes in graphlab.library.algorithms.goperators.product with type parameters of type BaseGraph | |
---|---|
class |
GProduct<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
|
Fields in graphlab.library.algorithms.goperators.product declared as BaseGraph | |
---|---|
protected GraphType |
GProduct.g1
|
protected GraphType |
GProduct.g2
|
Uses of BaseGraph in graphlab.library.algorithms.graphdecomposition |
---|
Methods in graphlab.library.algorithms.graphdecomposition with parameters of type BaseGraph | |
---|---|
java.util.Vector<Pair<java.util.Vector<VertexType>,java.util.Vector<EdgeType>>> |
BiconnectedComponents.Bicon(BaseGraph<VertexType,EdgeType> g)
This is the main method, wich take the graph g as the input, and returns the biconnected components of g in a vector. |
Uses of BaseGraph in graphlab.library.algorithms.homomorphism |
---|
Methods in graphlab.library.algorithms.homomorphism that return BaseGraph | |
---|---|
BaseGraph<VertexType,EdgeType> |
Homomorphism.getDomain()
|
BaseGraph<VertexType,EdgeType> |
Homomorphism.getRange()
|
Uses of BaseGraph in graphlab.library.algorithms.shortestpath |
---|
Classes in graphlab.library.algorithms.shortestpath with type parameters of type BaseGraph | |
---|---|
class |
AcyclicSP<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
|
class |
Johnson<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
This Algorithm computes the lenght of the shortest path between any two arbitrary vertices. |
Methods in graphlab.library.algorithms.shortestpath with parameters of type BaseGraph | |
---|---|
java.util.Vector<VertexType> |
AcyclicSP.acyclicSP(BaseGraph<VertexType,EdgeType> g,
VertexType v)
|
java.util.Vector<VertexType> |
BellmanFord.computePaths(BaseGraph<VertexType,EdgeType> graph,
VertexType Vertex)
A graph with a negative cycle is not well defined as the input of a shortest path algorithm. |
java.lang.Integer[][] |
FloydWarshall.getAllPairsShortestPath(BaseGraph<VertexType,EdgeType> graph)
|
java.util.Vector<VertexType> |
Dijkstra.getShortestPath(BaseGraph<VertexType,EdgeType> graph,
VertexType vertex)
This method finds a reference array using Dijkstra algorithm from which, one can find the shortest paths of all vertices of a graph from an arbitrary given vertex. |
Uses of BaseGraph in graphlab.library.algorithms.sorting |
---|
Methods in graphlab.library.algorithms.sorting with parameters of type BaseGraph | ||
---|---|---|
static
|
TopologicalSort.doSort(BaseGraph<VertexType,EdgeType> graph)
|
Uses of BaseGraph in graphlab.library.algorithms.spanningtree |
---|
Methods in graphlab.library.algorithms.spanningtree with parameters of type BaseGraph | ||
---|---|---|
static
|
Kruskal.findMinimumSpanningTree(BaseGraph<VertexType,EdgeType> graph)
|
Constructors in graphlab.library.algorithms.spanningtree with parameters of type BaseGraph | |
---|---|
Prim(BaseGraph<VertexType,EdgeType> graph,
EdgeVertexCopier<VertexType,EdgeType> gc)
Constructor of the Prim algorithm. |
Uses of BaseGraph in graphlab.library.algorithms.subgraphs |
---|
Methods in graphlab.library.algorithms.subgraphs that return BaseGraph | ||
---|---|---|
static
|
InducedSubgraphs.getEdgeInducedSubgraph(BaseGraph<VertexType,EdgeType> graph,
java.util.AbstractList<EdgeType> inducedEdges)
|
|
static
|
InducedSubgraphs.getVertexInducedSubgraph(BaseGraph<VertexType,EdgeType> graph,
java.util.AbstractList<VertexType> inducedVertices)
|
Methods in graphlab.library.algorithms.subgraphs with parameters of type BaseGraph | ||
---|---|---|
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 BaseGraph in graphlab.library.algorithms.traversal |
---|
Constructors in graphlab.library.algorithms.traversal with parameters of type BaseGraph | |
---|---|
BreadthFirstSearch(BaseGraph<VertexType,EdgeType> graph)
|
|
DepthFirstSearch(BaseGraph<VertexType,EdgeType> graph)
|
Uses of BaseGraph in graphlab.library.algorithms.util |
---|
Methods in graphlab.library.algorithms.util that return BaseGraph | ||
---|---|---|
static
|
LibraryUtils.complement(BaseGraph<VertexType,EdgeType> g1)
|
|
static
|
LibraryUtils.edgeInduced(BaseGraph<VertexType,EdgeType> g,
java.util.Collection<EdgeType> S)
|
|
static
|
LibraryUtils.induced(BaseGraph<VertexType,EdgeType> g,
java.util.Collection<VertexType> S)
|
|
static
|
LibraryUtils.join(BaseGraph<VertexType,EdgeType> g1,
BaseGraph<VertexType,EdgeType> g2)
|
Methods in graphlab.library.algorithms.util with parameters of type BaseGraph | ||
---|---|---|
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.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 BaseGraph in graphlab.library.algorithms.vertexcover |
---|
Constructors in graphlab.library.algorithms.vertexcover with parameters of type BaseGraph | |
---|---|
AppVertexCover(BaseGraph<VertexType,EdgeType> graph,
EdgeVertexConverter<VertexType,VertexType,EdgeType,EdgeType> gc)
|
Uses of BaseGraph in graphlab.library.event |
---|
Fields in graphlab.library.event declared as BaseGraph | |
---|---|
BaseGraph<VertexType,EdgeType> |
PreWorkEvent.graph
|
BaseGraph<VertexType,EdgeType> |
PostWorkEvent.graph
|
BaseGraph<VertexType,EdgeType> |
VertexRequest.graph
|
BaseGraph<VertexType,EdgeType> |
VertexEvent.graph
|
BaseGraph<VertexType,EdgeType> |
EdgeRequest.graph
|
BaseGraph<VertexType,EdgeType> |
EdgeEvent.graph
|
BaseGraph<VertexType,EdgeType> |
GraphEvent.graph
|
Methods in graphlab.library.event that return BaseGraph | |
---|---|
BaseGraph<VertexType,EdgeType> |
GraphRequest.getGraph()
|
Methods in graphlab.library.event with parameters of type BaseGraph | |
---|---|
void |
GraphRequest.setGraph(BaseGraph<VertexType,EdgeType> graph)
|
Constructors in graphlab.library.event with parameters of type BaseGraph | |
---|---|
EdgeEvent(BaseGraph<VertexType,EdgeType> graph,
EdgeType edge)
Constructs an event that means a new edge is added to the graph. |
|
EdgeEvent(BaseGraph<VertexType,EdgeType> graph,
EdgeType edge,
EdgeEvent.EventType et)
Constructs an event that means an event is occured on a specified edge. |
|
EdgeRequest(BaseGraph<VertexType,EdgeType> graph)
|
|
GraphEvent(BaseGraph<VertexType,EdgeType> g)
Constructs a GraphEvent object that represents construction of a new graph. |
|
GraphEvent(BaseGraph<VertexType,EdgeType> g,
GraphEvent.EventType et)
Constructs a GraphEvent object corresponding to graph g and event et . |
|
PostWorkEvent(VertexType from,
VertexType to,
BaseGraph<VertexType,EdgeType> graph)
|
|
PreWorkEvent(VertexType from,
VertexType to,
BaseGraph<VertexType,EdgeType> graph)
|
|
VertexEvent(BaseGraph<VertexType,EdgeType> graph,
VertexType vertex)
Constructs an event that means a new vertex is added. |
|
VertexEvent(BaseGraph<VertexType,EdgeType> graph,
VertexType vertex,
VertexEvent.EventType et)
Constructs an event that means an event is occured on a specified vertex. |
|
VertexRequest(BaseGraph<VertexType,EdgeType> graph)
|
|
VertexRequest(BaseGraph<VertexType,EdgeType> graph,
java.lang.String message)
|
Uses of BaseGraph in graphlab.library.event.typedef |
---|
Constructors in graphlab.library.event.typedef with parameters of type BaseGraph | |
---|---|
BaseEdgeEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseEdge<BaseVertex> edge)
|
|
BaseEdgeEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseEdge<BaseVertex> edge,
EdgeEvent.EventType et)
|
|
BaseEdgeRequest(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph)
|
|
BaseGraphEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> g)
|
|
BaseGraphEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> g,
GraphEvent.EventType et)
|
|
BaseVertexEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseVertex vertex)
|
|
BaseVertexEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseVertex vertex,
VertexEvent.EventType et)
|
|
BaseVertexRequest(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph)
|
Uses of BaseGraph in graphlab.library.genericcloners |
---|
Uses of BaseGraph in graphlab.library.test |
---|
Methods in graphlab.library.test with parameters of type BaseGraph | ||
---|---|---|
static
|
TestListGraph.setRandomWeights(BaseGraph<VertexType,EdgeType> graph,
int limit)
|
Uses of BaseGraph in graphlab.plugins.main.core |
---|
Methods in graphlab.plugins.main.core with parameters of type BaseGraph | ||
---|---|---|
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 int |
AlgorithmUtils.getTotalDegree(BaseGraph g,
BaseVertex v)
retunrs the degree of vertex (indegree + outdegree) |
|
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 |
|
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 |
Uses of BaseGraph in graphlab.plugins.main.saveload.matrix |
---|
Methods in graphlab.plugins.main.saveload.matrix with parameters of type BaseGraph | ||
---|---|---|
static
|
Matrix.graph2Matrix(BaseGraph<vt,et> g)
|
|
GraphLab Project | |||||||||
PREV NEXT | FRAMES NO FRAMES |