|
GraphLab Project | |||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of BaseEdge in graphlab.graph.graph |
---|
Subclasses of BaseEdge in graphlab.graph.graph | |
---|---|
class |
EdgeModel
User: azin azadi,roozbeh ebrahimi |
Uses of BaseEdge in graphlab.library |
---|
Classes in graphlab.library with type parameters of type BaseEdge | |
---|---|
class |
BaseGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Generic base class for representation of all types of graphs. |
class |
ListGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Adjacency List Graph. |
class |
MatrixGraph<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Adjacency Matrix Graph. |
Methods in graphlab.library that return BaseEdge | |
---|---|
BaseEdge |
BaseEdge.getCopy(VertexType v1,
VertexType v2)
|
Methods in graphlab.library with parameters of type BaseEdge | |
---|---|
int |
BaseEdge.compareTo(BaseEdge<VertexType> o)
Compares two edges according to their wrights. |
Uses of BaseEdge in graphlab.library.algorithms.coloring |
---|
Classes in graphlab.library.algorithms.coloring with type parameters of type BaseEdge | |
---|---|
class |
SampleColoring<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseEdge in graphlab.library.algorithms.goperators |
---|
Methods in graphlab.library.algorithms.goperators with type parameters of type BaseEdge | ||
---|---|---|
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 BaseEdge in graphlab.library.algorithms.goperators.product |
---|
Classes in graphlab.library.algorithms.goperators.product with type parameters of type BaseEdge | |
---|---|
class |
GProduct<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
|
Uses of BaseEdge in graphlab.library.algorithms.graphdecomposition |
---|
Classes in graphlab.library.algorithms.graphdecomposition with type parameters of type BaseEdge | |
---|---|
class |
BiconnectedComponents<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
This Method find the biconnected components of a graph. |
Uses of BaseEdge in graphlab.library.algorithms.homomorphism |
---|
Classes in graphlab.library.algorithms.homomorphism with type parameters of type BaseEdge | |
---|---|
class |
Homomorphism<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseEdge in graphlab.library.algorithms.shortestpath |
---|
Uses of BaseEdge in graphlab.library.algorithms.sorting |
---|
Methods in graphlab.library.algorithms.sorting with type parameters of type BaseEdge | ||
---|---|---|
static
|
TopologicalSort.doSort(BaseGraph<VertexType,EdgeType> graph)
|
Uses of BaseEdge in graphlab.library.algorithms.spanningtree |
---|
Classes in graphlab.library.algorithms.spanningtree with type parameters of type BaseEdge | |
---|---|
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 BaseEdge | ||
---|---|---|
static
|
Kruskal.findMinimumSpanningTree(BaseGraph<VertexType,EdgeType> graph)
|
Uses of BaseEdge in graphlab.library.algorithms.subgraphs |
---|
Methods in graphlab.library.algorithms.subgraphs with type parameters of type BaseEdge | ||
---|---|---|
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 BaseEdge in graphlab.library.algorithms.traversal |
---|
Classes in graphlab.library.algorithms.traversal with type parameters of type BaseEdge | |
---|---|
class |
BreadthFirstSearch<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Description here. |
class |
DepthFirstSearch<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseEdge in graphlab.library.algorithms.util |
---|
Methods in graphlab.library.algorithms.util with type parameters of type BaseEdge | ||
---|---|---|
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 BaseEdge in graphlab.library.algorithms.vertexcover |
---|
Classes in graphlab.library.algorithms.vertexcover with type parameters of type BaseEdge | |
---|---|
class |
AppVertexCover<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
|
Uses of BaseEdge in graphlab.library.event |
---|
Fields in graphlab.library.event declared as BaseEdge | |
---|---|
EdgeType |
VertexEdgeLabelEvent.e
|
EdgeType |
EdgeEvent.edge
|
Uses of BaseEdge in graphlab.library.event.typedef |
---|
Constructors in graphlab.library.event.typedef with parameters of type BaseEdge | |
---|---|
BaseEdgeEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseEdge<BaseVertex> edge)
|
|
BaseEdgeEvent(BaseGraph<BaseVertex,BaseEdge<BaseVertex>> graph,
BaseEdge<BaseVertex> edge,
EdgeEvent.EventType et)
|
Constructor parameters in graphlab.library.event.typedef with type arguments of type BaseEdge | |
---|---|
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 BaseEdge in graphlab.library.genericcloners |
---|
Methods in graphlab.library.genericcloners that return BaseEdge | |
---|---|
BaseEdge<BaseVertex> |
BaseEdgeVertexCopier.convert(BaseEdge<BaseVertex> e,
BaseVertex newSource,
BaseVertex newTarget)
|
Methods in graphlab.library.genericcloners with parameters of type BaseEdge | |
---|---|
BaseEdge<BaseVertex> |
BaseEdgeVertexCopier.convert(BaseEdge<BaseVertex> e,
BaseVertex newSource,
BaseVertex newTarget)
|
Uses of BaseEdge in graphlab.library.test |
---|
Subclasses of BaseEdge in graphlab.library.test | |
---|---|
class |
TestNewEdge
|
Methods in graphlab.library.test with type parameters of type BaseEdge | ||
---|---|---|
static
|
TestListGraph.setRandomWeights(BaseGraph<VertexType,EdgeType> graph,
int limit)
|
Methods in graphlab.library.test that return types with arguments of type BaseEdge | |
---|---|
static ListGraph<BaseVertex,BaseEdge<BaseVertex>> |
TestListGraph.generateRandomListGraph(int vertexCount,
int edgeCount)
|
Methods in graphlab.library.test with parameters of type BaseEdge | |
---|---|
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)
|
Uses of BaseEdge in graphlab.plugins.main.core |
---|
Methods in graphlab.plugins.main.core with type parameters of type BaseEdge | ||
---|---|---|
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 |
Method parameters in graphlab.plugins.main.core with type arguments of type BaseEdge | |
---|---|
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 BaseEdge in graphlab.plugins.main.saveload.matrix |
---|
Methods in graphlab.plugins.main.saveload.matrix with type parameters of type BaseEdge | ||
---|---|---|
static
|
Matrix.graph2Matrix(BaseGraph<vt,et> g)
|
|
GraphLab Project | |||||||||
PREV NEXT | FRAMES NO FRAMES |