This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: XSL-T to map a D(A)G
one alternative is to use an existing grapher. one possibility is the
graphviz package. the generators for ".dot"-encoded graphs of DTD and
XML included in cl-xml were not complicated. the only issues are to
generate unique node names and identify the root. graphviz the rest of
the work. (see www.cl-xml.org and www.graphviz.org)
Mark Nahabedian wrote:
>
> Goetz Bock writes:
> [...]
> > I know that such a mapping is not easy and due to the scructur of the
> > XML it is possible to created the strangest graphs :-(
> > But I'd be happy just do map a DAG, ignorring all the backward
> > references.
> >
> > I don't need this immediatly, because this functionality will only be
> > the suggar for my current project.
> > Anyway, has anyone ever written a D(A)G mapper in XSL-T?
> > Or should I just forget XSL-T for this and use a "real" programming
> > language.
>
> The hardest part of your problem is an algorithmic one, not a
> programming one. How does one decide where to place the nodes of the
> graph.
>
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list