DGA$_2$D: Directed Graph-Guided Automated Algorithm Design with Large Language Models
A Directed Graph-Guided Automated Algorithm Design framework, termed DGA$_2$D, which structures the open-ended program space as a directed graph, where each node represents a functional operator that can be instantiated using one of multiple candidate code implementations, while directed walks constitute complete algor...