1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*
* $Revision: 3837 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2013-11-13 15:19:30 +0100 (Wed, 13 Nov 2013) $
***************************************************************/
/** \file
* \brief Declarations for GraphML Parser
*
* \author Łukasz Hanuszczak
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_GRAPHML_PARSER_H
#define OGDF_GRAPHML_PARSER_H
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/ClusterGraphAttributes.h>
#include <ogdf/basic/HashArray.h>
#include <ogdf/basic/List.h>
#include <ogdf/fileformats/XmlParser.h>
#include <sstream>
namespace ogdf {
class GraphMLParser {
private:
XmlParser m_xml;
XmlTagObject *m_graphTag; // "Almost root" tag.
HashArray<string, node> m_nodeId; // Maps GraphML node id to Graph node.
HashArray<string, string> m_attrName; // Maps attribute id to its name.
bool readData(
GraphAttributes &GA,
const node &v, const XmlTagObject &nodeData);
bool readData(
GraphAttributes &GA,
const edge &e, const XmlTagObject &edgeData);
bool readData(
ClusterGraphAttributes &CA,
const cluster &c, const XmlTagObject &clusterData);
// Finds all data-keys for given element and calls appropiate "readData".
template <typename A, typename T>
bool readAttributes(A &GA, const T &elem, const XmlTagObject &elemTag) {
List<XmlTagObject *> dataTags;
elemTag.findSonXmlTagObjectByName("data", dataTags);
forall_listiterators(XmlTagObject *, it, dataTags) {
const bool result = readData(GA, elem, **it);
if(!result) {
return false;
}
}
return true;
}
bool readNodes(
Graph &G, GraphAttributes *GA,
const XmlTagObject &rootTag);
bool readEdges(
Graph &G, GraphAttributes *GA,
const XmlTagObject &rootTag);
bool readClusters(
Graph &G, ClusterGraph &C, ClusterGraphAttributes *CA,
const cluster &rootCluster, const XmlTagObject &clusterRoot);
bool m_error;
public:
GraphMLParser(istream &in);
~GraphMLParser();
bool read(Graph &G);
bool read(Graph &G, GraphAttributes &GA);
bool read(Graph &G, ClusterGraph &C);
bool read(Graph &G, ClusterGraph &C, ClusterGraphAttributes &CA);
};
} // end namespace ogdf
#endif
|
