def writeDirectedGraph[V <: Node]()

in cassovary-core/src/main/scala/com/twitter/cassovary/util/io/GraphWriter.scala [54:67]

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

  def writeDirectedGraph[V <: Node](graph: DirectedGraph[V], writers: Seq[Writer],
      formatAdjacency: Boolean = false, sortByIds: Boolean = false): Unit = {
    val chunks = writers.size
    val nodesForChunk = ((graph.nodeCount - 1) / chunks) + 1
    val nodesIterator = if (sortByIds) graph.toSeq.sortBy(_.id).iterator else graph.iterator
    nodesIterator.grouped(nodesForChunk).zip(writers.iterator).foreach {
      case (nodes, writer) =>
        val gWriter = new PrintWriter(writer)
        nodes foreach {
          if (formatAdjacency) writeNodeAdjacency(gWriter) else writeNodeListEdges(gWriter)
        }
        gWriter.close()
    }
  }