
__ Remarks about CGF and "mkfoldnet" __


-  CGF is a replacement for CPF, the 3-regular graphs generator.
   CGF's options are mostly a superset of those of CPF, with some
   syntax changes which CaGe will handle for you.  CGF assumes that the
   "long" type is 64 bit wide.  If "long"s width is 32 bit, CGF will
   compile with warnings about left/right shifts being too big for
   the type, this can be ignored.  Should your "long" be over 64 bit,
   there will be potential problems, but only with options that CaGe
   doesn't use at the moment.
   There is one CPF option that has no CGF equivalent, "pathface
   maximal {pathface_max}".  But as the original CPF page has it,
   "for normal use this option is completely unimportant".


-  "mkfoldnet" will create, out of a 3D-embedded graph, PostScript
   code for a "folding net" of the 3D embedding.  This can be printed
   and folded back into a physical representation of the graph.  The
   folding nets are collected in a file named like the log file and all
   other graph collections that you can create from the output window,
   with a ".ps" extension.  Have fun.


