Access restriction computation
Thanks for your reply. I've updated my talk page and Computing access restrictions. Basically, the graph of modes is probably sound (though wheelchair should probably be removed, come to think of it). The algorithm could be modified in two ways to deal with this:
- Deal with the single-rooted-DAG by specifying a search to root. Sketched out on the main page
- Deal with the multiple inheritance of motorboat by partitioning the problem space on waterway vs. highway. Essentially you'd have two trees at this point, one for highway, and one for waterway (very linear!)
Hope that makes sense. --achadwick 12:13, 12 March 2009 (UTC)
Ebbene sì, ne ho avuto conferma ieri sera: M(')appare Milano può finalmente ufficialmente sconfinare.
Se ci sarai, indica sul wiki la tua presenza!
Teniamoci in contatto per definire gli ultimi dettagli.
--Stemby 11:56, 14 May 2009 (UTC)