code: private void prioritizeFromEntryNode(DiGraphNode<Node, Branch> entry) {
      PriorityQueue<DiGraphNode<Node, Branch>> worklist =
          new PriorityQueue<>(10, priorityComparator);
      worklist.add(entry);
  
      while (!worklist.isEmpty()) {
        DiGraphNode<Node, Branch> current = worklist.remove();
        if (nodePriorities.containsKey(current)) {
          continue;
        }
  
        nodePriorities.put(current, ++priorityCounter);
  
        List<DiGraphNode<Node, Branch>> successors = cfg.getDirectedSuccNodes(current);
        worklist.addAll(successors);
      }
    }
docs: Given an entry node, find all the nodes reachable from that node
  and prioritize them.