Has anyone got an solution to this problem....?

[cs5gr@scms.rgu.ac.UK (Graeme Raffan)]

Could anyone help with this problem:

----------------------------
Implement the Dijkstra-Scholten algorithm for a (hypothetical) network
comprising four nodes: NODE(1), NODE(2), NODE(3), NODE(4).

Choose an arbitrary network topology (subject to the restriction that
every node is reachable from the environment node NODE(1))

The distributed application which is implemented on the network is a
simple broadcast algorithm. NODE(1) sends a message (an integer value)
on each outgoing edge. The first time a message is received by any
node, it must record the message value and relay the message on all of
its outgoing edges. The next time the message is received, the node
just reads and discards the message.

Impose a termination detection scheme on top of this application, and
design the system so that the environment node displays a prompt when
it knows that all nodes have received the broadcast.

---------------------------------
Unfortunately no-one else here at the university seems to know
much about Ada and I'm new to it myself.
Could you please mail me if you can help.

Thanks in advance,
		Graeme.

--
       ___
    __|___|__
     ('O-O')
___ooO-(_)-Ooo____ Graeme Raffan (BSc.)
___|___|___|___|__ Mail: cs5gr@scms.rgu.ac.uk
_|___|___|___|___|