Final project for data structures
- has n vertices
- has m edges
- filing to store the graph
- has a vertex of degree k
- has m vertices of degree k
- has a circuit
of length k - has a simple circuit of length k
- has m
simplecircuitsof length k - is connected
- has an euler circuit
-
optionalhas a Hamiltonian circuit