GraphLab Project

Uses of Class
graphlab.library.exceptions.InvalidVertexException

Packages that use InvalidVertexException
graphlab.graph.graph   
graphlab.library   
graphlab.library.algorithms.shortestpath   
graphlab.library.algorithms.spanningtree   
graphlab.library.algorithms.traversal   
graphlab.library.algorithms.vertexcover   
 

Uses of InvalidVertexException in graphlab.graph.graph
 

Methods in graphlab.graph.graph that throw InvalidVertexException
 void GraphModel.removeAllEdges(VertexModel source, VertexModel target)
           
 void GraphModel.removeVertex(VertexModel v)
           
 

Uses of InvalidVertexException in graphlab.library
 

Methods in graphlab.library that throw InvalidVertexException
 boolean MatrixGraph.breadthFirstSearch(VertexType vertex, PreWorkHandler<VertexType> handler)
          Runs Breadth First Search (BFS) algorithm on the graph starting from vertex vertexId.
 void ListGraph.checkVertex(VertexType v)
           
abstract  void BaseGraph.checkVertex(VertexType v)
          If the supplied vertex is invalid (Not one of graph's vertices), throws InvalidVertexException.
 void MatrixGraph.checkVertex(VertexType v)
           
 boolean MatrixGraph.depthFirstSearch(VertexType vertex, PreWorkPostWorkHandler<VertexType> handler)
          Runs Depth First Search (DFS) algorithm on the graph starting from vertex vertexId.
 java.util.Iterator<EdgeType> ListGraph.edgeIterator(VertexType v)
           
abstract  java.util.Iterator<EdgeType> BaseGraph.edgeIterator(VertexType v)
          Constructs an Edge Iterator object which iterates through all the edges going to or coming from the specified vertex v.
 java.util.Iterator<EdgeType> MatrixGraph.edgeIterator(VertexType v)
           
 java.util.AbstractList<EdgeType> ListGraph.getEdges(VertexType source, VertexType target)
           
abstract  java.util.AbstractList<EdgeType> BaseGraph.getEdges(VertexType source, VertexType target)
          Returns a collection of all edges which connects two vertices supplied as first and second arguments of this method.
 java.util.ArrayList<EdgeType> MatrixGraph.getEdges(VertexType source, VertexType target)
          Returns all edges between two vertices.
 int ListGraph.getInDegree(VertexType v)
           
abstract  int BaseGraph.getInDegree(VertexType v)
          Returns in-degree of vertex vertexId, the number of edges which their target goes to the specified vertex.
 int MatrixGraph.getInDegree(VertexType v)
           
 int ListGraph.getOutDegree(VertexType v)
           
abstract  int BaseGraph.getOutDegree(VertexType v)
          Returns out-degree of the supplied vertex, the number of edges which their source is attached to the specified vertex.
 int MatrixGraph.getOutDegree(VertexType v)
           
 void ListGraph.insertEdge(EdgeType newEdge)
           
abstract  void BaseGraph.insertEdge(EdgeType newEdge)
          Inserts an edge in the graph.
 void MatrixGraph.insertEdge(EdgeType newEdge)
           
 boolean ListGraph.isEdge(VertexType source, VertexType target)
           
abstract  boolean BaseGraph.isEdge(VertexType source, VertexType target)
          Returns true if there is an edge between specified vertices (direction considered for directed graphs).
 boolean MatrixGraph.isEdge(VertexType source, VertexType target)
           
 java.util.Iterator<EdgeType> ListGraph.lightEdgeIterator(VertexType v)
           
abstract  java.util.Iterator<EdgeType> BaseGraph.lightEdgeIterator(VertexType v)
          Constructs a light(weight) Edge Iterator object which iterates through all the edges going to or coming from the specified vertex v.
 java.util.Iterator<EdgeType> MatrixGraph.lightEdgeIterator(VertexType v)
           
 void ListGraph.removeAllEdges(VertexType source, VertexType target)
           
abstract  void BaseGraph.removeAllEdges(VertexType source, VertexType target)
          Removes all edges between two vertices.
 void MatrixGraph.removeAllEdges(VertexType source, VertexType target)
           
 void ListGraph.removeVertex(VertexType v)
           
abstract  void BaseGraph.removeVertex(VertexType v)
          Removes a vertex and all it's connected edges.
 void MatrixGraph.removeVertex(VertexType v)
           
 

Uses of InvalidVertexException in graphlab.library.algorithms.shortestpath
 

Methods in graphlab.library.algorithms.shortestpath that throw InvalidVertexException
 java.util.Vector<VertexType> AcyclicSP.acyclicSP(BaseGraph<VertexType,EdgeType> g, VertexType v)
           
 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 InvalidVertexException in graphlab.library.algorithms.spanningtree
 

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

Methods in graphlab.library.algorithms.traversal that throw InvalidVertexException
 boolean BreadthFirstSearch.doSearch(VertexType vertex, PreWorkHandler<VertexType> handler)
           
 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 InvalidVertexException in graphlab.library.algorithms.vertexcover
 

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


GraphLab Project