<p>External difference families (EDFs) are combinatorial objects which were introduced in the early 2000s, motivated by information security applications such as the construction of AMD codes. Various generalizations have since been defined and investigated, in particular strong external difference families (SEDFs) and circular external difference families (CEDFs). In this paper, we present a framework based on graphs and digraphs which offers a new unified way to view these structures, and leads to natural new research questions. We present constructions and structural results about these digraph-defined EDFs, and we obtain new explicit constructions for infinite families of CEDFs, in particular <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\((ml^2+1,m,l,1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <msup> <mi>l</mi> <mn>2</mn> </msup> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>m</mi> <mo>,</mo> <mi>l</mi> <mo>,</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-CEDFs. Our techniques include cyclotomy in finite fields and direct constructions in cyclic groups and direct products of cyclic groups. We construct the first infinite family of such CEDFs in non-cyclic abelian groups; these have odd values of <i>m</i> and <i>l</i>. We also present the first CEDF in a non-abelian group.</p>