Packages

object GraphIO

The GraphIO object is the companion object to the GraphIO class and is used for reading graphs from files.

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

Value Members

  1. def apply(name: String, base: String = BASE_DIR, ext: String = EXT, sep: Char = ','): Graph

    Read a graph from a file based on the format used by 'print' and 'write':

    Read a graph from a file based on the format used by 'print' and 'write':

    Graph (<name>, <inverse>, <nVertices> <vertexId>,

    name

    the file-name containing the graph's vertex, edge and label information

    base

    the base sub-directory for storing graphs

    ext

    the standard file extension for graph

    sep

    the character separating the values (e.g., ',', ' ', '\t')

  2. def makeSet(eStrArr: Array[String]): Set[Int]

    Given an array of integers as strings, make the corresponding set.

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

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

    Read 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)

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

    Read a graph from TWO specially formatted Pajek files.

    Read 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)