| Links: |
| File Format Links |
GXL -
an XML-based graph exchange format developed for software re-engineering.
GraphXML -
XML-based file format for graphs that was presented at Graph Drawing 2000 and is superseded by GraphML.
GML -
a widely used graph exchange format (non-XML).
XGMML -
an XML-based file format for graphs based on GML.
SVG -
an XML-based graphics format.
|
| Graph Drawing Links |
www.graphdrawing.org -
home of graph drawing
GD 2004 -
12th Int. Symp. Graph Drawing, 12-14 Sep 2004, Harlem, NYC
|
| XML Links |
XML -
home of the Extensible Markup Language at the World Wide Web Consortium.
|
|
back to the element overview
Element: graph
Description: Describes one graph in this document.
Occurence: <graphml>, <node>, <edge>, <hyperedge>.
Type: graph.type
Complex type for the <graph> element.
Type is final.
Attributes:
id
(optional)
of type xs:NMTOKEN
identifies this graph .
Identity Constraint Definitions: graph_id_unique
edgedefault
(required)
of type graph.edgedefault.type
describes whether edges of this graph are considered
as directed or undirected per default (unless
specified by the attribute directed of <edge>).
graph.extra.attrib
Contents:
desc?,
(
(
data | node | edge | hyperedge
)
* | locator
)
Identity Constraint Definitions:
-
graph_data_key_unique
-
Ensures: uniqueness of the key attributes of <data> children
of this <graph> element.
-
edge_id_unique
-
Ensures: uniqueness of the id attributes of
each <edge> element in this graph.
-
hyperedge_id_unique
-
Ensures: uniqueness of the id attributes of
each <hyperedge> element in this graph.
-
endpoint_id_unique
-
Ensures: uniqueness of the id attributes of
each <endpoint> element in this graph.
-
node_id_key
-
Ensures: existence and uniqueness of the id attributes of
each <node> element in this graph.
-
edge_source_ref refers node_id_key
-
Ensures: for the source attribute of each <edge> in this graph,
the existence of an id attribute of
<node> which matches the value of it.
-
edge_target_ref refers node_id_key
-
Ensures: for the target attribute of each <edge> in this graph,
the existence of an id attribute of
<node> which matches the value of it.
-
endpoint_node_ref refers node_id_key
-
Ensures: for the node attribute of each <endpoint> in this graph,
the existence of an id attribute of
<node> which matches the value of it.
back to the element overview
|
| News: |
| coming soon |
|
LEDA extension package for GraphML.
|
| 18 March 2003 |
|
XML Schema specification and documentation available for GraphML 1.0rc
(release candidate)
|
| 23 July 2002 |
|
GraphML presentation at the
annual meeting
of DFG Research Priority 1126
Algorithmic Aspects
of Large and Complex Networks.
(ps,
pdf)
|
| 28 June 2002 |
|
yFiles
extension package for GraphML version 1.0 released.
|
| 22 May 2002 |
|
Release candidates for extensions
graphml-attributes (for data attributes) and
graphml-parseinfo (for lightweight parsers)
completed.
See current specification.
|
| 12 March 2002 |
|
GraphML proposed as the standard format for the
network data archive to be created within EU FET Open Project
COSIN.
|
|
