An algorithm for computing the algebraic structure count in polygraphs is p
resented. It expresses the related determinant of the adjacency matrix of a
polygraph in terms of the determinants of monographs and bonding edges bet
ween the monographs. The algorithm is illustrated on a class of polygraphs
with two bonding edges between monographs and computations for selected exa
mples of polygraphs of this class are presented.