Maximum maximal placements.


R. Clayton (rclayton@monmouth.edu)
(no date)


  It seems your main routine can always find a placement that puts a
  witness-criminal in every town on the map. Is that possible?

Only in a world without roads. It's been fixed; thanks for pointing it out.

  I want to use a hash set for the program, but I can't find it on my version
  of linux (redhat 8.0). Do you know if it's available on this version or not?

Hashed containers are a non-standard extension to the STL (which are being
considered for inclusion in the next standards update going on now). Because I
want you to write ANSI-ISO standard code, you should not use them. On the
other hand, the only thing I require is that your code compile and run on my
test system (cslab machines). If you can do that, I'm not going to penalize
you for using them.

I don't know what extra-standard features of the STL linux supports. You can
download versions of the STL with the hash containers from SGI (
www.sgi.com/tech/stl/download.html ) or STLPort ( www.stlport.org/download.html
) (Dinkumware has them too, but I believe you have to pay for those). But be
careful: because hash containers are not yet standard, these implementations
differ from each other both in their interfaces and in their behavior (this
last clause is an example of what what programmers call a "red flag"; it means
you should run away as fast as you can).



This archive was generated by hypermail 2.0b3 on Fri May 09 2003 - 15:30:05 EDT