S.O.S. Mathematics CyberBoard

Hi everyone

Assume we have some points so that each point can call the other.
take for instance, five points: a, b, c, d, and e; they communicate each other as follows:
a calls b
b calls c
c replies i.e., to b
b replies i.e., to a
a calls d
d calls c
c replies i.e., to d
d calls e
e replies i.e., to d
d replies i.e, to a

I need to find the path in order way like this:
a, b, c, b, a, d, c, e, d, a

I used a software tool to do this but it generated a path similar to what I want ..like this:
a, b, c, -, -, d, c, -, e, -, -

where - is the caller point i.e it generates the uiques points' names

Now I took such result and store it in an array or list but I failed to replace dashes with the suiatble point

Can anyone help me to replace these dashes

The tool which I used names Altova UModel


Many thanks for any suggestion
full_adder

Use a stack. Convert a,b,... into "push (whatever)", and - as "pop".

_________________

Stack is Ok if the path is straightline one by one
i.e., the next point depends on the previuos one
but in the mentiond example , the matter is different

a calls b
b calls c
c replies i.e., to b
b replies i.e., to a
a calls d
d calls c
c replies i.e., to d
d calls e
e replies i.e., to d
d replies i.e, to a
a calls f
f replies i.e., to a

a, b, c, -, -, d, c, -, e, -, -,f,-

Stack tracing: (n dashes requires n+1 pops s.t. the first pop is discarded)
operation stack cont.
---------- --------------------
push(a) a
push(b) a,b
push(c) a,b,c
pop (discarded) a,b
pop a
pop <empty>
push(d) d
push(c) d,c
pop (discarded) d
pop <empty>
push(e) e
pop (discarded)
pop <empty>
pop <empty>
push(f) f
pop <empty>

If we print out the result of each operation to the screen
a,b,c,b,a,d,c,d,e,f

the right path is: a,b,c,b,a,d,c,d,e,d,a,f,a

What do you think?

full_adder

You want a temporary variable ("at") too. So when you get a,b,c,... you first push whatever on "at" to the stack, and let your "at" holds the new point name. When you encounter a "-" you pop to "at".

So taking your example "a, b, c, -, -, d, c, -, e, -, -, f, -", it looks like

_________________

I solved it without Stack and "at"

i.e., save memory.. right?
changing is done on the same list
I differentiate between original elements in the array and non-original elements
where the original one is that appears on the original path while the non-original elements are those replaced with "-"s

We cab do such differentiation with appending a flag to the replaced elements

so the code will look like this

for i=1 to n
if A(i) is "-" then
tmp = A(i-1)
for j= i-1 down to 1
if A(j) is original and equlas tmp then
replace A(i) with A(j-1)
exit loop
end if
end for
end if
end for

I tested it with, it works well

However, I feel the code of "outermeasure" i.e., using Stack and "at" temp List is more safe..

I am not sure about this point exactly..

What do you think?
full_adder