Graph

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 apply(gFile: String, inverse: Boolean): Graph

   

   Reads a graph from ONE file based on the format used by 'write2File': <vertexId> ...

   Reads a graph from ONE file based on the format used by 'write2File': <vertexId> ...

   gFile

   the file containing the graph's label and edge information

   inverse

   whether to store inverse adjacency sets (parents)

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

    

    Definition Classes

    AnyRef → Any

11. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. def read2Files(lFile: String, eFile: String, inverse: Boolean = false): Graph

    

    Reads a graph from TWO files: 'lFile' is a file with one label per line, where each line represents the vertex with id <lineNumber>.

    Reads a graph from TWO files: 'lFile' is a file with one label per line, where each line represents the vertex with id <lineNumber>. 'eFile' is a file with each line representing the vertex with id <lineNumber>, and each line contains a space-separated list of vertices to which the current vertex is adjacent.

    lFile

    the file containing the graph labels

    eFile

    the file the edges (to create adjacency sets)

    inverse

    whether to store inverse adjacency sets (parents)

17. def read2PajekFile(lFile: String, eFile: String, inverse: Boolean = false): Graph

    

    Reads a graph from TWO specially formatted Pajek files.

    Reads a graph from TWO specially formatted Pajek files.

    lFile

    the file containing the graph labels

    eFile

    the file the edges (to create adjacency sets)

    inverse

    whether to store inverse adjacency sets (parents)

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

    

    Definition Classes

    AnyRef

19. def toString(): String

    

    Definition Classes

    AnyRef → Any

20. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )