随机生辰欧拉图，通过深度优先遍历来求欧拉回路-Random birthday Euler diagram, depth-first traversal through the pursuit of Euler circuit

The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then ra

The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then ra

Derive current and voltage an electric circuit with Euler Lagrange formulism-Derive current and voltage an electric circuit with Euler Lagrange formulism