Which of the following is true of vertex-edge graphs?
A.)They can model real-world problems.
B.)They can all be solved.
C.)Euler paths are the same as Hamilton paths.
D.)All vertices must be used once in Hamilton circuits.
I didn't know this one, honestly i don't care at the moment. So please help me on this..