Find cyclical dependencies in Open Webslides' frontend code

find_deps.rb

#!/usr/bin/env ruby

NODES = []

`grep -r "from 'modules/" app/modules`.split(%r{$}).map(&:strip).each do |line|
  next if line.empty?

  split = line.split ':'

  source = split.first.match(%r{^app/modules/([^/]*)})&.captures&.first
  target = split.last.match(%r{^import .* from 'modules/([^']*)';$})&.captures&.first

  puts "No source found in '#{split.first}'" unless source
  puts "No target found in '#{split.last}'" unless target

  next unless source && target

  NODES << { :source => source, :target => target }
end

NODES.uniq!

def dfs(graph, traversed, node)
  # The graph is cyclical if we have already visited a node
  if traversed.any? node
    traversed << node

    puts "Cycle found! #{traversed.join ' -> '}"
    return
  end

  traversed << node

  # Visit all adjacent nodes
  graph.select { |n| n[:source] == node }.each do |child|
    dfs graph, traversed.dup, child[:target]
  end
end

NODES.each do |start|
  traversed = []
  traversed << start[:source]

  dfs NODES, [], start[:target]
end

puts '---'
NODES.group_by { |n| n[:source] }.sort.each do |key, value|
  puts "package \e[31;1m#{key}\e[0m imports \e[31;1m#{value.map {|n| n[:target] }.sort.join(', ')}\e[0m"
end