parbo / icfp2021

My attempt at ICFP Contest 2021 (with GUI)

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

ICFP Contest 2021

How it works

There are checks for validity of all edges. There's a binary heap of starting points (placed vertices), which is sorted on number of placed vertices and then on least dislikes. Then it will pick the most constrained vertex and add the valid positions for that.

About

My attempt at ICFP Contest 2021 (with GUI)


Languages

Language:Rust 93.6%Language:Shell 6.4%