GraphCreator

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def createGraphChiRelationGraph(params: JValue, shouldShardGraph: Boolean): Unit

9. def createGraphChiRelationGraph(params: JValue): Unit

10. def createMatrices(params: JValue): Boolean

11. def deduplicateEdges(params: JValue): Boolean

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

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

15. implicit val formats: DefaultFormats.type

16. def generateSyntheticRelationSet(params: JValue): RelationSet

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

    Definition Classes

    AnyRef → Any

18. def getNumShards(numEdges: Int): Int

19. def getRelationSets(params: JValue): Seq[RelationSet]

20. def getSvoPrefixes(relationSets: Seq[RelationSet]): Map[RelationSet, String]

    Create a prefix for each SVO file as necessary, according to how they were embedded.

    Create a prefix for each SVO file as necessary, according to how they were embedded.

    If the edges are embedded, we need to differentiate the latent representations if they were not made together. That is, if we have two or more embedded SVO files, and they have embeddings files that are _different_, that means that a +L1 edge from one and a +L1 edge from another are not the same edge type. So we add a prefix to the edge type that is specific to each embedding. This isn't a problem with KB edges vs. SVO edges, because the "alias" relation assures that the two kinds of edges will never share the same space.

21. def hashCode(): Int

    Definition Classes

    AnyRef → Any

22. val inProgressFile: String

23. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

24. val matrixOutDir: String

25. def maxMatrixFileSize(params: JValue): Int

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 outputDictionariesToDisk(nodeDict: Dictionary, edgeDict: Dictionary): Unit

30. def outputMatrices(filename: String, maxMatrixFileSize: Int): Unit

31. val paramFile: String

32. val relationSetDir: String

33. def shardGraph(baseFilename: String, numShards: Int): Unit

    Runs GraphChi's preprocessing (sharding) on the graph.

    Runs GraphChi's preprocessing (sharding) on the graph. This produces a number of shard files, and if the files are already present, this is a no-op. So it's only run once for each graph, no matter how many times you run GraphChi code.

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

    Definition Classes

    AnyRef

35. var synthetic_data_creator_factory: ISyntheticDataCreatorFactory

36. def toString(): String

    Definition Classes

    AnyRef → Any

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( ... )

40. def writeEdgesSoFar(_start_relation: Int, end_relation: Int, edges_to_write: Seq[Seq[(Int, Int)]]): Unit