GraphOps

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. def constructGraph(triples: RDD[Triple]): Graph[Node, Node]

   

   Constructs GraphX graph from RDD of triples

   Constructs GraphX graph from RDD of triples

   triples

   rdd of triples

   returns

   object of GraphX which contains the constructed graph.

7. def constructHashedGraph(triples: RDD[Triple]): Graph[Node, Node]

   

   Constructs Hashed GraphX graph from RDD of triples

   Constructs Hashed GraphX graph from RDD of triples

   triples

   rdd of triples

   returns

   object of GraphX which contains the constructed hashed graph.

8. def constructStringGraph(triples: RDD[Triple]): Graph[String, String]

   

   Constructs String GraphX graph from RDD of triples

   Constructs String GraphX graph from RDD of triples

   triples

   rdd of triples

   returns

   object of GraphX which contains the constructed string graph.

9. def difference(graph: Graph[Node, Node], other: Graph[Node, Node]): Graph[Node, Node]

   

   Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.

   Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.

   graph

   the RDF graph

   other

   the other RDF graph

   returns

   the difference of both RDF graphs

10. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def filterObjects(graph: Graph[Node, Node], func: (Node) ⇒ Boolean): Graph[Node, Node]

    

    Filter out the objects from a given graph, based on a specific function @func .

    Filter out the objects from a given graph, based on a specific function @func .

    graph

    one instance of the given graph

    func

    a partial funtion.

    returns

    Node] a subset of the given graph.

13. def filterPredicates(graph: Graph[Node, Node], func: (Node) ⇒ Boolean): Graph[Node, Node]

    

    Filter out the predicates from a given graph, based on a specific function @func .

    Filter out the predicates from a given graph, based on a specific function @func .

    graph

    one instance of the given graph

    func

    a partial funtion.

    returns

    Node] a subset of the given graph.

14. def filterSubjects(graph: Graph[Node, Node], func: (Node) ⇒ Boolean): Graph[Node, Node]

    

    Filter out the subject from a given graph, based on a specific function @func .

    Filter out the subject from a given graph, based on a specific function @func .

    graph

    one instance of the given graph

    func

    a partial funtion.

    returns

    Node] a subset of the given graph.

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

16. def find(graph: Graph[Node, Node], subject: Node, predicate: Node, object: Node): Graph[Node, Node]

    

    Finds triplets of a given graph.

    Finds triplets of a given graph.

    graph

    one instance of the given graph

    returns

    graph which contains subset of the reduced graph.

17. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

18. def getObjects(graph: Graph[Node, Node]): RDD[Node]

    

    Get objects from a given graph.

    Get objects from a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Node] which contains list of the objects.

19. def getPredicates(graph: Graph[Node, Node]): RDD[Node]

    

    Get predicates from a given graph.

    Get predicates from a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Node] which contains list of the predicates.

20. def getSubjects(graph: Graph[Node, Node]): RDD[Node]

    

    Get subjects from a given graph.

    Get subjects from a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Node] which contains list of the subjects.

21. def getTriples(graph: Graph[Node, Node]): RDD[Triple]

    

    Get triples of a given graph.

    Get triples of a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Triple] which contains list of the graph triples.

22. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

23. def hierarcyDepth(graph: Graph[Node, Node]): Graph[(VertexId, Int, Node), Node]

    

    Returns the lever at which vertex stands in the hierarchy.

    Returns the lever at which vertex stands in the hierarchy.

    graph

    the RDF graph

24. def intersection(graph: Graph[Node, Node], other: Graph[Node, Node]): Graph[Node, Node]

    

    Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.

    Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.

    graph

    the RDF graph

    other

    the other RDF graph

    returns

    the intersection of both RDF graphs

25. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

26. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

27. final def notify(): Unit

    

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

29. def shortestPaths[VD, ED](graph: Graph[VD, ED], landmarks: Seq[VertexId])(implicit arg0: ClassTag[ED]): Graph[SPMap, ED]

    

    Computes shortest paths to the given set of landmark vertices.

    Computes shortest paths to the given set of landmark vertices.

    ED

    the edge attribute type (not used in the computation)

    graph

    the graph for which to compute the shortest paths

    landmarks

    the list of landmark vertex ids. Shortest paths will be computed to each landmark.

    returns

    a graph where each vertex attribute is a map containing the shortest-path distance to each reachable landmark vertex.

30. def size(graph: Graph[Node, Node]): Long

    

    Compute the size of the graph

    Compute the size of the graph

    returns

    the number of edges in the graph.

31. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

32. def toDF(graph: Graph[Node, Node]): DataFrame

    

    Convert a graph into a DataFrame.

    Convert a graph into a DataFrame.

    graph

    GraphX graph of triples.

    returns

    a DataFrame of triples.

33. def toDS(graph: Graph[Node, Node]): Dataset[Triple]

    

    Convert a graph into a Dataset of Triple.

    Convert a graph into a Dataset of Triple.

    graph

    GraphX graph of triples.

    returns

    a Dataset of triples.

34. def toRDD(graph: Graph[Node, Node]): RDD[Triple]

    

    Convert a graph into a RDD of Triple.

    Convert a graph into a RDD of Triple.

    graph

    GraphX graph of triples.

    returns

    a RDD of triples.

35. def toString(): String

    

    Definition Classes

    AnyRef → Any

36. def union(graph: Graph[Node, Node], other: Graph[Node, Node]): Graph[Node, Node]

    

    Return the union of this graph and another one.

    Return the union of this graph and another one.

    graph

    of the graph

    other

    of the other graph

    returns

    graph (union of all)

37. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )