undirected weighted graph to xml

Question

I want to represent an undirected graph, like this one :

http://cnx.org/content/m29399/latest/Picture%202.png

into an xml file. I'm not really sure how to begin.

EDIT: I want the data in xml format, so I can reconstruct the graph using the xml.

thanks in advance

score 1 · Answer 1 · answered Jan 09 '13 at 10:49

1

IMHO you shouldn't try to reinvent the wheel, just use one of the already existing XML-based graph formats: GraphML, XGMML or GXL. GraphML seems to be the easiest to start with.

answered Jan 09 '13 at 10:49

Tamás

47,239
12
105
124

score 0 · Answer 2 · answered Jan 08 '13 at 14:27

0

Do you need to turn the graphic into xml, or do you have the data in some format already?

The first is hard, for the second you can take a look at Boost::Graph.

answered Jan 08 '13 at 14:27

DanDan

10,462
8
53
69

From boost graph you should be able to export to GraphML. – DanDan Jan 08 '13 at 14:37
I'm not really familiar with c++, so I'm not sure how to use Boost::Graph. The application that will use the xml will be written in java. – Wouter Milants Jan 08 '13 at 15:11
Take a look at GraphML anyway, it might be a good format you can use. – DanDan Jan 08 '13 at 17:51

score 0 · Answer 3 · answered Jan 08 '13 at 17:21

A graph consists of vertices and edges. So at the top level the XML description should look like this

<graph>
    <vertices>...</vertices>
    <edges>...</edges>
</graph>

The <vertices> container will have <vertex> elements to carry the information for each vertex. In particular, you will need a unique identifier by which edges can refer to a vertex. So, something like this

    <vertices>
        <vertex id="A">other information, if needed</vertex>
        <vertex id="B">...</vertex>
        ...
    </vertices>

Each <edge> inside the <edges> container will need at least three pieces of information: the vertices connected, and the weight on the edge. Thus, for example

    <edges>
        <edge ends="A B">7</edge>
        <edge ends="B C">8</edge>
        ...
    </edges>

You can put all this into a schema where, for example, you can enforce a requirement that the 'ends' attribute carries references to ids of vertices that do exist in the graph (viz., look up xs:ID and xs:IDREF in the XML Schema documentation).

score 0 · Answer 4 · answered Jan 09 '13 at 10:44

I kept trying things and this seems to be working :

   <Nodes>
       <Node>
           <Name>A</Name>
       </Node> 
       <Node>
           <Name>B</Name>
       </Node> 
        ....
   </Nodes>

   <Routes>
       <Route>
          <from>A</from>
          <to>B</to>
          <cost>7</cost>
        </Route>
        ....
   </Routes>

Probably not the best way but this works for me :)enter code here

undirected weighted graph to xml

4 Answers4