GraphLab Project

Uses of Class
graphlab.library.util.Pair

Packages that use Pair
graphlab.graph   
graphlab.graph.graph   
graphlab.library.algorithms.graphdecomposition   
graphlab.library.algorithms.spanningtree   
 

Uses of Pair in graphlab.graph
 

Methods in graphlab.graph that return Pair
static Pair<EdgeModel,java.lang.Double> GraphUtils.mindiste(GraphModel g, GraphPoint p)
           
static Pair<VertexModel,java.lang.Double> GraphUtils.mindistv(GraphModel g, GraphPoint p)
           
 

Uses of Pair in graphlab.graph.graph
 

Methods in graphlab.graph.graph that return Pair
 Pair GraphControlGrid.mindiste(GraphModel g, GraphPoint p)
           
static Pair<EdgeModel,java.lang.Double> GraphControl.mindiste(GraphModel g, GraphPoint p)
           
static Pair<VertexModel,java.lang.Double> GraphControl.mindistv(GraphModel g, GraphPoint p)
           
 Pair<VertexModel,java.lang.Double> GraphControlGrid.mindistv(GraphPoint p)
           
 

Uses of Pair in graphlab.library.algorithms.graphdecomposition
 

Methods in graphlab.library.algorithms.graphdecomposition that return types with arguments of type Pair
 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 Pair in graphlab.library.algorithms.spanningtree
 

Methods in graphlab.library.algorithms.spanningtree that return Pair
 Pair<java.util.Vector<VertexType>,java.util.Vector<EdgeType>> Prim.findMinimumSpanningTree(VertexType v)
          Finds minimum spanning tree starting at vertex v.
 Pair<java.util.Vector<VertexType>,java.util.Vector<EdgeType>> Prim.findMinimumSpanningTree(VertexType v, java.util.Comparator<EdgeType> comparator)
          Finds minimum spanning tree starting at vertex v.
 


GraphLab Project