Extended General Einsums for Expressing and Optimizing Graph Algorithms

The EDGE language provides a unified, mathematical framework for expressing graph algorithms using extended Einsum notation from tensor algebra, enabling a separation of concerns between what to compute and how to compute it.