atom feed21 messages in com.mulberrytech.lists.xsl-listRe: [xsl] Graph processing
FromSent OnAttachments
Jones Mark Mr (ITCS)Mar 18, 2008 7:29 am 
Andrew WelchMar 18, 2008 8:27 am 
Jones Mark Mr (ITCS)Mar 18, 2008 9:32 am 
Martin HonnenMar 18, 2008 9:37 am 
David CarlisleMar 18, 2008 9:37 am 
Jones Mark Mr (ITCS)Mar 18, 2008 10:10 am 
acMar 18, 2008 10:10 pm 
acMar 18, 2008 10:25 pm 
Mukul GandhiMar 19, 2008 1:28 am 
Michael KayMar 19, 2008 2:15 am 
Michael KayMar 19, 2008 2:21 am 
David CarlisleMar 19, 2008 3:01 am 
Patrick BergeronMar 19, 2008 7:17 am 
David CarlisleMar 19, 2008 7:28 am 
Wendell PiezMar 19, 2008 9:44 am 
Michael KayMar 19, 2008 10:21 am 
acMar 19, 2008 10:33 am 
Ken TamMar 19, 2008 9:49 pm 
Dimitre NovatchevMar 19, 2008 10:38 pm 
Dimitre NovatchevMar 20, 2008 6:34 am 
Michael KayMar 20, 2008 7:31 am 
Subject:Re: [xsl] Graph processing
From:Dimitre Novatchev (dnov@gmail.com)
Date:Mar 19, 2008 10:38:54 pm
List:com.mulberrytech.lists.xsl-list

I need to process graphs in GraphML format.

See:

http://lists.xml.org/archives/xml-dev/200401/msg00505.html

-- Cheers, Dimitre Novatchev --------------------------------------- Truly great madness cannot be achieved without significant intelligence. --------------------------------------- To invent, you need a good imagination and a pile of junk ------------------------------------- Never fight an inanimate object ------------------------------------- You've achieved success in your field when you don't know whether what you're doing is work or play

On Wed, Mar 19, 2008 at 9:49 PM, Ken Tam <ken@proteustech.com> wrote:

Hi all,

I need to process graphs in GraphML format. For example,

given the following graph:

A / | \ B C D / \ E F / \ / \ G H I / \ J K

will be represented in GraphML as:

<?xml version="1.0" encoding="UTF-8"?> <graphml xmlns="http://graphml.graphdrawing.org/xmlns" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd"> <graph id="G" edgedefault="directed"> <node id="A"/> <node id="B"/> <node id="C"/> <node id="D"/> <node id="E"/> <node id="F"/> <node id="G"/> <node id="H"/> <node id="I"/> <node id="J"/> <node id="K"/> <edge source="A" target="B"/> <edge source="A" target="C"/> <edge source="A" target="D"/> <edge source="B" target="E"/> <edge source="B" target="F"/> <edge source="E" target="G"/> <edge source="E" target="H"/> <edge source="F" target="H"/> <edge source="F" target="I"/> <edge source="H" target="J"/> <edge source="H" target="K"/> </graph> </graphml>

One sample process is to find all paths starting from "B" passing through "H" ending in "K". The results are:

B->E->H->K B->F->H->K

Can XSL/XPATH be used to find the paths? or a transformation needs to be done first from graph to tree with ID and IDREF before applying XPATH axis expressions. This is just a simple example and the real graphs contain many shared paths. Thus, a tree representation will be very large with many duplicated branches.