@i gb_types.w
@*Intro. We output an Eulerian trail of the (undirected) graph named on the
command line. (Each edge is considered to be two directed arcs; thus it
is traversed in both directions.)
If the graph isn't connected, we consider only the vertices that are
reachable from the first one, |g->vertices|.
@c
#include
#include
#include "gb_graph.h"
#include "gb_save.h"
@@;
main(int argc,char*argv[]) {
register int k;
Graph *g;
Vertex *u,*v;
Arc *a;
@;
@;
@