GraphLab Project

Uses of Class
graphlab.library.exceptions.InvalidGraphException

Packages that use InvalidGraphException
graphlab.library   
graphlab.library.algorithms.spanningtree   
graphlab.library.algorithms.traversal   
graphlab.library.algorithms.util   
graphlab.library.algorithms.vertexcover   
 

Uses of InvalidGraphException in graphlab.library
 

Methods in graphlab.library that throw InvalidGraphException
 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)
           
 

Constructors in graphlab.library that throw InvalidGraphException
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 InvalidGraphException in graphlab.library.algorithms.spanningtree
 

Methods in graphlab.library.algorithms.spanningtree that throw InvalidGraphException
 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.
 

Uses of InvalidGraphException in graphlab.library.algorithms.traversal
 

Methods in graphlab.library.algorithms.traversal that throw InvalidGraphException
 boolean DepthFirstSearch.doSearch(VertexType vertex, PreWorkPostWorkHandler<VertexType> handler, boolean resetMarks)
          Runs Depth First Search (DFS) algorithm on the graph starting from vertex vertexId.
 

Uses of InvalidGraphException in graphlab.library.algorithms.util
 

Methods in graphlab.library.algorithms.util that throw InvalidGraphException
static
<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
boolean
ConnectivityChecker.isGraphConnected(BaseGraph<VertexType,EdgeType> graph)
          Checks whether the current graph is a connected graph.
 

Uses of InvalidGraphException in graphlab.library.algorithms.vertexcover
 

Methods in graphlab.library.algorithms.vertexcover that throw InvalidGraphException
 java.util.Vector<VertexType> AppVertexCover.findAppCover()
           
 


GraphLab Project