def readGraph()

in cassovary-benchmarks/src/main/scala/com/twitter/cassovary/PerformanceBenchmark.scala [110:128]

• 16 lines of code
• 5 McCabe index (conditional complexity)

  def readGraph(path: String, filename: String, adjacencyList: Boolean): DirectedGraph[Node] = {
    if (adjacencyList) {
      AdjacencyListGraphReader.forIntIds(path, filename, isGzip = gzipFlag()).toArrayBasedDirectedGraph()
    } else {
      val sep = separatorInt().toChar
      val graphDir = if (dirInFlag() && dirOutFlag())
        StoredGraphDir.BothInOut
      else if (dirInFlag())
        StoredGraphDir.OnlyIn
      else
        StoredGraphDir.OnlyOut

      printf("Using Character (%d in Int) as separator\n", sep.toInt)
      ListOfEdgesGraphReader.forIntIds(path, filename, graphDir = graphDir,
        separator = sep, isGzip = gzipFlag()).toSharedArrayBasedDirectedGraph(forceSparseRepr = None)
      //separator = sep).toArrayBasedDirectedGraph(neighborsSortingStrategy = LeaveUnsorted,
      //      forceSparseRepr = None)
    }
  }