A new representation of procedural knowledge in algorithm design, called Generative Executable Algorithm Knowledge Graphs (GEAKG), allows for the transfer of knowledge across domains by storing validated operators, admissible compositions, and effective sequences in a graph. This enables the reuse of procedural knowledge without runtime language-model calls.