GraphLab Project

Uses of Class
graphlab.library.BaseEdge

Packages that use BaseEdge
graphlab.graph.graph   
graphlab.library   
graphlab.library.algorithms.coloring   
graphlab.library.algorithms.goperators   
graphlab.library.algorithms.goperators.product   
graphlab.library.algorithms.graphdecomposition   
graphlab.library.algorithms.homomorphism   
graphlab.library.algorithms.shortestpath   
graphlab.library.algorithms.sorting   
graphlab.library.algorithms.spanningtree   
graphlab.library.algorithms.subgraphs   
graphlab.library.algorithms.traversal   
graphlab.library.algorithms.util   
graphlab.library.algorithms.vertexcover   
graphlab.library.event   
graphlab.library.event.typedef   
graphlab.library.genericcloners   
graphlab.library.test   
graphlab.plugins.main.core   
graphlab.plugins.main.saveload.matrix   
 

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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
GraphComplement.complement(BaseGraph<VertexType,EdgeType> g1)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
EdgeInduced.edgeInduced(BaseGraph<VertexType,EdgeType> g, java.util.Collection<EdgeType> S)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
VertexInduced.induced(BaseGraph<VertexType,EdgeType> g, java.util.Collection<VertexType> S)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
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
 

Classes in graphlab.library.algorithms.shortestpath with type parameters of type BaseEdge
 class AcyclicSP<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
           
 class BellmanFord<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
          This method finds the shortest path from a source vertex v, to all vertices of the graph.
 class Dijkstra<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
          This method finds the shortest path from a vertex to all vertices of a graph.
 class FloydWarshall<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
          This method finds the shortest paths between any two vertices of a graph.
 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.
 class ShortestPaths<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 

Uses of BaseEdge in graphlab.library.algorithms.sorting
 

Methods in graphlab.library.algorithms.sorting with type parameters of type BaseEdge
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
java.util.AbstractList<VertexType>
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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
java.util.AbstractList<EdgeType>
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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
InducedSubgraphs.getEdgeInducedSubgraph(BaseGraph<VertexType,EdgeType> graph, java.util.AbstractList<EdgeType> inducedEdges)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
LibraryUtils.complement(BaseGraph<VertexType,EdgeType> g1)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
LibraryUtils.edgeInduced(BaseGraph<VertexType,EdgeType> g, java.util.Collection<EdgeType> S)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
LibraryUtils.falsifyEdgeMarks(BaseGraph<VertexType,EdgeType> g)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
LibraryUtils.falsifyVertexMarks(BaseGraph<VertexType,EdgeType> g)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean[]
LibraryUtils.getVertexMarks(BaseGraph<VertexType,EdgeType> g)
          returns all vertex marks in a array
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
LibraryUtils.induced(BaseGraph<VertexType,EdgeType> g, java.util.Collection<VertexType> S)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
AcyclicChecker.isGraphAcyclic(BaseGraph<VertexType,EdgeType> graph)
          Checks whether the current graph is acyclic.
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
ConnectivityChecker.isGraphConnected(BaseGraph<VertexType,EdgeType> graph)
          Checks whether the current graph is a connected graph.
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
BaseGraph<VertexType,EdgeType>
LibraryUtils.join(BaseGraph<VertexType,EdgeType> g1, BaseGraph<VertexType,EdgeType> g2)
           
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
void
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
 

Classes in graphlab.library.event with type parameters of type BaseEdge
 class EdgeEvent<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
          Happens when an edge's color or weight changes or a new edge is added to the graph.
 class EdgeRequest<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 class GraphEvent<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 class GraphRequest<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 class PostWorkEvent<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 class PreWorkEvent<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 class VertexEdgeLabelEvent<VertexType extends BaseVertex,EdgeType extends BaseEdge>
          Happens wheever we want to put labels on vertices or edges (now just for debugging, we don't have label for basevertex/edge yet)
 class VertexEvent<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
          Happens when a vertex's color changes or a new vertex is added to the graph or ...
 class VertexRequest<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 

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
 

Classes in graphlab.library.genericcloners with type parameters of type BaseEdge
 interface EdgeConverter<ImportVertexType extends BaseVertex,ExportVertexType extends BaseVertex,ImportEdgeType extends BaseEdge<ImportVertexType>,ExportEdgeType extends BaseEdge<ExportVertexType>>
           
 interface EdgeConverter<ImportVertexType extends BaseVertex,ExportVertexType extends BaseVertex,ImportEdgeType extends BaseEdge<ImportVertexType>,ExportEdgeType extends BaseEdge<ExportVertexType>>
           
 interface EdgeVertexConverter<ImportVertexType extends BaseVertex,ExportVertexType extends BaseVertex,ImportEdgeType extends BaseEdge<ImportVertexType>,ExportEdgeType extends BaseEdge<ExportVertexType>>
           
 interface EdgeVertexConverter<ImportVertexType extends BaseVertex,ExportVertexType extends BaseVertex,ImportEdgeType extends BaseEdge<ImportVertexType>,ExportEdgeType extends BaseEdge<ExportVertexType>>
           
 interface EdgeVertexCopier<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
           
 interface GraphConverter<ImportVertexType extends BaseVertex,ExportVertexType extends BaseVertex,ImportEdgeType extends BaseEdge<ImportVertexType>,ExportEdgeType extends BaseEdge<ExportVertexType>,ImportGraphType extends BaseGraph<ImportVertexType,ImportEdgeType>,ExportGraphType extends BaseGraph<ExportVertexType,ExportEdgeType>>
           
 interface GraphConverter<ImportVertexType extends BaseVertex,ExportVertexType extends BaseVertex,ImportEdgeType extends BaseEdge<ImportVertexType>,ExportEdgeType extends BaseEdge<ExportVertexType>,ImportGraphType extends BaseGraph<ImportVertexType,ImportEdgeType>,ExportGraphType extends BaseGraph<ExportVertexType,ExportEdgeType>>
           
 

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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
void
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
<Vertex extends BaseVertex,Edge extends BaseEdge<Vertex>>
void
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
<Vertex extends BaseVertex,Edge extends BaseEdge<Vertex>>
java.util.ArrayList<Vertex>
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
<Vertex extends BaseVertex,Edge extends BaseEdge<Vertex>>
java.util.ArrayList<Vertex>
AlgorithmUtils.BFSOrder(BaseGraph<Vertex,Edge> unRootedTree, Vertex treeRoot)
          gets the vertices in the order of AlgorithmUtils.getSubTree()
static
<Vertex extends BaseVertex,Edge extends BaseEdge<Vertex>>
void
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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
void
AlgorithmUtils.clearVertexMarks(BaseGraph<VertexType,EdgeType> g)
          clears all vertex marks
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
void
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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
java.util.ArrayList<java.util.ArrayList<java.lang.Integer>>
AlgorithmUtils.getAdjList(BaseGraph<VertexType,EdgeType> g)
          Deprecated. use BaseGraph.getEdgeArray instead
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
int
AlgorithmUtils.getDegree(BaseGraph<VertexType,EdgeType> bg, int node)
          Deprecated.  
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
java.util.ArrayList<java.lang.Integer>
AlgorithmUtils.getDegreesList(BaseGraph<VertexType,EdgeType> g)
          returns the vertex degrees as a list, sorted by vertex ids
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
java.util.ArrayList<VertexType>
AlgorithmUtils.getNeighbors(BaseGraph<VertexType,EdgeType> g, VertexType source)
          Deprecated.  
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
java.util.ArrayList<VertexType>
AlgorithmUtils.getNeighbors2(BaseGraph<VertexType,EdgeType> g, VertexType source)
          Deprecated.  
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
VertexType
AlgorithmUtils.getParent(BaseGraph<VertexType,EdgeType> g, VertexType treeRoot, VertexType v)
          returns the parent of v, if ve DFS on parent
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
Path<VertexType>
AlgorithmUtils.getPath(BaseGraph<VertexType,EdgeType> g, VertexType source, VertexType dest)
          returns a path from source to target path.get(0) = dest
static
<Vertex extends BaseVertex,Edge extends BaseEdge<Vertex>>
Vertex
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
<Vertex extends BaseVertex,Edge extends BaseEdge<Vertex>>
java.util.ArrayList<Vertex>
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
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
AlgorithmUtils.isCompleteGraph(BaseGraph<VertexType,EdgeType> g)
          determines wether g is complete or not
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
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
<vt extends BaseVertex,et extends BaseEdge<vt>>
boolean[][]
Matrix.graph2Matrix(BaseGraph<vt,et> g)
           
 


GraphLab Project