- From: Dan Connolly <connolly@w3.org>
- Date: Wed, 24 Aug 2005 17:50:24 -0400
- To: public-cwm-bugs@w3.org
If the pretty printer supported is/of, it could print any acyclic graph without making up bnode identifiers, by finding the/a spanning tree. Or at least it sounded plausible when timbl said it just now. ;-) -- Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Wednesday, 24 August 2005 21:50:28 UTC