Ardenian
A
Ardenian
I have an issue where I need to do the following:
I have n array variabled integers. Each integer can have the value of another integer variable array from the list.
Example:
Integer[1] = 5
Integer[5] = 3
Now I need to check the following:
If Integer[A] == Integer[?] then
If Integer[?] == Integer[??] and Integer[??] != A then
In words:
I need to check if a certain integer is linked to another and if that other integer is linked to another one and if that one is not linked to the first one.
I am not sure whether my approach is correct.
I aim for checking whether certain integers are not linked to another structure.
Example:
Integer[1] = 5
Integer[5] = 1
with all other variable values !=1 and !=5
Imagine it like bubbles. Integers form a bubble, linking to each other, and I need to check whether
there are more than one bubble, independent bubbles.
Any suggestions ?
I have n array variabled integers. Each integer can have the value of another integer variable array from the list.
Example:
Integer[1] = 5
Integer[5] = 3
Now I need to check the following:
If Integer[A] == Integer[?] then
If Integer[?] == Integer[??] and Integer[??] != A then
In words:
I need to check if a certain integer is linked to another and if that other integer is linked to another one and if that one is not linked to the first one.
I am not sure whether my approach is correct.
I aim for checking whether certain integers are not linked to another structure.
Example:
Integer[1] = 5
Integer[5] = 1
with all other variable values !=1 and !=5
Imagine it like bubbles. Integers form a bubble, linking to each other, and I need to check whether
there are more than one bubble, independent bubbles.
Any suggestions ?