glebm

struct TopSortResult {
  bool ok;

  // If `ok`, contains the topologically sorted node indices.
  // Otherwise, contains indices of a detected cycle.
  std::vector<std::size_t> nodes;
};

// Topologically sorts dependencies.
TopSortResult topsort(const std::vector<std::vector<int>> &edges) {

ncweinhold

(define simple-func
  (lambda ()
    (display "Script called, now I can change this") (newline)))

(define quick-test
  (lambda ()
    (display "Adding another function, can modify without recompilation") 
    (newline)
    (adding-without-recompilation)))