-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
carmelo wrote:
imagine to have a k-ary tree, each node is a room and each edge is a
corridor; each room has a value assigned, you must place cameras in
rooms but if a room has an adiacent room with the camera you can't
place the camera inside...you must place the cameras to have the max
value possibile.. how to choose the rooms?
Speaking of rooms, you got the wrong one. Sorry.
What you want is comp.programming, up two floors, on the left side
across from the elevators. They can help you with your algorithm and
theory problems.
Here , we are mechanics working in the C language. If you had a problem
with some specific C code (standards conformant, if you please. We
don't like homebrew or propriatary extensions) we could help you.
Sorry
- --
Lew Pitcher
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.3 (MingW32) - WinPT 0.11.12
iD8DBQFFCsYvagVFX4UWr64RAkRHAKDV9SC0Gq5vzilctmqthz N6JzaUHgCg9Wmb
S3p8+K+45ljDzMekGkIdL3k=
=VORC
-----END PGP SIGNATURE-----