def topPathsTill()

in cassovary-core/src/main/scala/com/twitter/cassovary/graph/DirectedPathCollection.scala [60:82]

• 19 lines of code
• 4 McCabe index (conditional complexity)

  def topPathsTill(node: Int, num: Int): Object2IntMap[DirectedPath] = {
    val pathCountMap = pathCountsPerIdWithDefault(node)
    val pathCount = pathCountMap.size
    val returnMap = new Object2IntArrayMap[DirectedPath]

    comparator.setNode(node)
    priQ.clear()

    val pathIterator = pathCountMap.keySet.iterator
    while (pathIterator.hasNext) {
      val path = pathIterator.next()
      priQ += path
    }

    var size = 0
    while (size < num && !priQ.isEmpty) {
      val path = priQ.deque()
      returnMap.put(path, pathCountMap.get(path))
      size += 1
    }

    returnMap
  }