Object

net.sansa_stack.rdf.flink.model.graph

GraphOps

Related Doc: package graph

Permalink

object GraphOps

Flink/Gelly based implementation of DataSet[Triple].

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphOps
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def constructGraph(triples: DataSet[Triple]): Graph[Long, Node, Node]

    Permalink

    Constructs Gelly graph from DataSet of triples

    Constructs Gelly graph from DataSet of triples

    triples

    DataSet of triples

    returns

    object of Graph which contains the constructed graph.

  7. var env: ExecutionEnvironment

    Permalink
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  12. def getObjects(graph: Graph[Long, Node, Node]): DataSet[Node]

    Permalink

    Get objects from a given graph.

    Get objects from a given graph.

    graph

    one instance of the given graph

    returns

    DataSet[Node] which contains list of the objects.

  13. def getPredicates(graph: Graph[Long, Node, Node]): DataSet[Node]

    Permalink

    Get predicates from a given graph.

    Get predicates from a given graph.

    graph

    one instance of the given graph

    returns

    DataSet[Node] which contains list of the predicates.

  14. def getSubjects(graph: Graph[Long, Node, Node]): DataSet[Node]

    Permalink

    Get subjects from a given graph.

    Get subjects from a given graph.

    graph

    one instance of the given graph

    returns

    DataSet[Node] which contains list of the subjects.

  15. def getTriples(graph: Graph[Long, Node, Node]): DataSet[Triple]

    Permalink

    Get triples of a given graph.

    Get triples of a given graph.

    graph

    one instance of the given graph

    returns

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

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. def size(graph: Graph[Long, Node, Node]): Long

    Permalink

    Compute the size of the graph

    Compute the size of the graph

    returns

    the number of edges in the graph.

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

    Permalink
    Definition Classes
    AnyRef
  23. def toDataSet(graph: Graph[Long, Node, Node]): DataSet[Triple]

    Permalink

    Convert a graph into a DataSet of Triple.

    Convert a graph into a DataSet of Triple.

    graph

    Gelly graph of triples.

    returns

    a DataSet of triples.

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. def union(graph: Graph[Long, Node, Node], other: Graph[Long, Node, Node]): Graph[Long, Node, Node]

    Permalink

    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)

  26. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped