1
////////////////////////////////////////////////////////////////////////////////
3
// This file is part of Toolkit for Conceptual Modeling (TCM).
4
// (c) copyright 2001, Universiteit Twente.
5
// Author: Frank Dehne (frank@cs.vu.nl), David N. Jansen (dnjansen@cs.utwente.nl).
7
// TCM is free software; you can redistribute it and/or modify
8
// it under the terms of the GNU General Public License as published by
9
// the Free Software Foundation; either version 2 of the License, or
10
// (at your option) any later version.
12
// TCM is distributed in the hope that it will be useful,
13
// but WITHOUT ANY WARRANTY; without even the implied warranty of
14
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
// GNU General Public License for more details.
17
// You should have received a copy of the GNU General Public License
18
// along with TCM; if not, write to the Free Software
19
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
21
////////////////////////////////////////////////////////////////////////////////
24
#include "inputfile.h"
25
#include "outputfile.h"
27
Node::Node(Graph *g): Subject(g) {
31
Node::Node(HyperGraph *hg): Subject(hg) {
35
bool Node::InGraph() const {
36
return GetGraph()->HasNode((Node *)this);
39
Subject::NameErrType Node::SetIndex(const string *s) {
44
void Node::WriteMembers(OutputFile *ofile) {
45
Subject::WriteMembers(ofile);
46
(*ofile) << "\t{ Index " << '"' << *GetIndex() << '"' << " }\n";
49
bool Node::ReadMembers(InputFile *ifile, double format) {
50
if (!Subject::ReadMembers(ifile, format))
54
if (!ifile->ReadStringAttribute("Index", &x))
61
void Node::GetParentIndex(string *s) {
63
*s = *GetParent()->GetIndex();
66
// construct index because parent does not exist.
67
if (*GetIndex() == "0") {
73
int len = s->length();
77
for(int j=i; j<len; j++)