For a row-finite graph G with no sinks and in which every loop has an exit, we construct an isomorphism between Ext(C*(G)) and coker(A—I), where A is the vertex matrix of G. If c is the class in Ext(C ...