RRYWNHFE3EIRQYBGMSZRLDGKWHVMDAO42QNKFQ2KVYPDC4IHANTAC 5D2IYPL75HEP6JUEILEADSZRRSV72NECT6UQR3PORNDR35I2P5GQC TGT4VSMEWWTFYILTXVZWA5WHB2RCZZYNGZJ3UUKZ5OPD6JQD4G5QC Q7TKZCJP2Z75EICZYKCEZDHKGERSOKZGMTSU3UXETBHTF663T66AC YDQLW2ZOAH7PZ7HHVTSFUO5IWE6O7FDNXVNIN7GG4TJ3P2B2BM4AC XTVLIC243WZF52NVTNRA3SV3WLE2ZZ5GTFQOK45IOLMXYQMTLOSAC LPGHALLKCQRJUB7BNHABAG2VEEAFTUSN3WAPASM5B3V6JJ54GXJQC 7WA2F6RSQBGJJE5MZGQGAYJOWYEKQUWVI2MTZ4AMICEEQFENXANQC }voidprintedgemap(struct edgemap *m){printf("edgemap {\n edges: [\n");for (size_t i = 0; i < m->edges.len; i++) {struct edge *e = &m->edges.entries[i];printf(" edge { previous = %u, flag = ", e->previous);print_edgeflags(e->flag);printf(", from = position { change = ");hashprint(&e->from.change);printf(", pos = %lu }", e->from.pos);printf(", to = vertex { change = ");hashprint(&e->to.change);printf(", start = %lu, end = %lu }, introducedby = ",e->to.start, e->to.end);hashprint(&e->introducedby);printf(" }\n");}printf(" ]\n}\n");
/* printf("edgemap {\n edges: [\n"); *//* for (i = 0; i < m->edges.len; i++) { *//* struct edge *e = &m->edges.entries[i]; *//* printf(" edge { previous = %u, flag = ", *//* e->previous); *//* print_edgeflags(e->flag); *//* printf(", from = position { change = "); *//* hashprint(&e->from.change); *//* printf(", pos = %lu }", e->from.pos); */
if (verbose)printedgemap(m);