The matrix of connections c++?

Hi all, we need to implement the similar task in C++, the problem is that I don't understand what they told me in this task I want and what I need to implement?

The job itself:

"The line is called unicursal if it is possible to draw without lifting the pen from paper and without passing twice the same edge. (Note that the line is unicursal only when the number of nodes from which follows an odd number of edges not more than two). The line that contains n nodes, you can specify a square matrix of connections (of order n) where the element aij =1 if node i is connected to node j by an edge that does not contain other nodes.
Task: enter the number of nodes in a certain line. By setting arbitrarily the matrix compounds (interactively or randomly) to determine whether there is such line unicursal and if so, to obtain a sequence of node numbers which will be completed for crossing the line."
March 19th 20 at 09:13
1 answer
March 19th 20 at 09:15
It was easier than I thought, thank you very much - marielle_Sanfo commented on March 19th 20 at 09:18

Find more questions by tags Visual StudioMathematical matrixC++