GraphCreator

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. def _runPipeline(): Unit

   

   Definition Classes

   Step

5. def _runStep(): Unit

   

   Definition Classes

   GraphCreator → Step

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. val binaryFilename: String

   

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def createGraphFiles(aliases: Seq[(String, Map[String, Seq[String]])], nodeDict: MutableConcurrentDictionary, edgeDict: MutableConcurrentDictionary): Unit

   

10. def createMatrices(filename: String, maxMatrixFileSize: Int): Unit

    

11. val deduplicateEdges: Boolean

    

12. val edgeDictFilename: String

    

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

    

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

16. implicit val formats: DefaultFormats.type

    

17. def generateSyntheticRelationSet(params: JValue): RelationSet

    

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

    

    Definition Classes

    AnyRef → Any

19. def getNumShards(numEdges: Int): Int

    

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. val graphName: String

    

22. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

23. val inProgressFile: String

    

    Definition Classes

    GraphCreator → Step

24. val inputAliasFiles: List[String]

    

25. val inputRelationFiles: List[String]

    

26. val inputs: Set[(String, Option[Step])]

    

    Definition Classes

    GraphCreator → Step

27. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

28. val loggedParams: Option[JValue]

    

    Definition Classes

    Step

29. lazy val logger: Logger

    

    Attributes

    protected

    Definition Classes

    LazyLogging

30. val matrixOutDir: String

    

31. val maxMatrixFileSize: Int

    

32. val name: String

    

    Definition Classes

    GraphCreator → Step

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

    

    Definition Classes

    AnyRef

34. val nodeDictFilename: String

    

35. final def notify(): Unit

    

    Definition Classes

    AnyRef

36. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

37. val outdir: String

    

38. val outputBinaryFile: Boolean

    

39. val outputMatrices: Boolean

    

40. val outputPlainTextFile: Boolean

    

41. val outputs: Set[String]

    

    Definition Classes

    GraphCreator → Step

42. val paramFile: String

    

    Definition Classes

    GraphCreator → Step

43. def parametersMatch(params1: JValue, params2: JValue): Boolean

    

    Definition Classes

    GraphCreator → Step

44. val plainTextFilename: String

    

45. val relationSets: List[RelationSet]

    

46. def runPipeline(): Unit

    

    Definition Classes

    Step

47. def runStep(): Unit

    

    Definition Classes

    Step

48. def runSubstepsInParallel: Boolean

    

    Definition Classes

    Step

49. 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.

50. val shouldShardGraph: Boolean

    

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

    

    Definition Classes

    AnyRef

52. var synthetic_data_creator_factory: ISyntheticDataCreatorFactory

    

53. def toString(): String

    

    Definition Classes

    AnyRef → Any

54. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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