← Back to branch summary

~ubuntu-branches/ubuntu/intrepid/tcm/intrepid

« back to all changes in this revision

Viewing changes to src/sd/fv/dfgraph.c

  • Committer: Bazaar Package Importer
  • Author(s): Otavio Salvador
  • Date: 2003-07-03 20:08:21 UTC
  • Revision ID: james.westby@ubuntu.com-20030703200821-se4xtqx25e5miczi
Tags: upstream-2.20
Import upstream version 2.20

Show diffs side-by-side

added added

removed removed

Lines of Context:
src/sd/fv/dfgraph.c
 
1
////////////////////////////////////////////////////////////////////////////////
 
2
//
 
3
// This file is part of Toolkit for Conceptual Modeling (TCM).
 
4
// (c) copyright 1995, Vrije Universiteit Amsterdam.
 
5
// Author: Frank Dehne (frank@cs.vu.nl).
 
6
//
 
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.
 
11
//
 
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.
 
16
//
 
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
 
20
// 02111-1307, USA.
 
21
////////////////////////////////////////////////////////////////////////////////
 
22
#include "dfgraph.h"
 
23
#include "dataprocess.h"
 
24
#include "util.h"
 
25
#include <stdlib.h>
 
26
 
 
27
DFGraph::DFGraph(): Graph() {
 
28
        int i=0;
 
29
        int j=0;
 
30
        nodeTypes[i++] = Code::COMMENT;
 
31
        nodeTypes[i++] = Code::DATA_PROCESS;
 
32
        nodeTypes[i++] = Code::DATA_STORE;
 
33
        nodeTypes[i++] = Code::EXTERNAL_ENTITY;
 
34
        nodeTypes[i++] = Code::SPLIT_MERGE_NODE;
 
35
        nodeTypes[i++] = 0;
 
36
 
 
37
        edgeTypes[j++] = Code::DATA_FLOW;
 
38
        edgeTypes[j++] = Code::BIDIRECTIONAL_DATA_FLOW;
 
39
        edgeTypes[j++] = 0;
 
40
}
 
41
 
 
42
void DFGraph::InitConnections() {
 
43
        int DTF=Code::GetIndex(Code::DATA_PROCESS, nodeTypes);  
 
44
        int STO=Code::GetIndex(Code::DATA_STORE, nodeTypes);
 
45
        int EXT=Code::GetIndex(Code::EXTERNAL_ENTITY, nodeTypes);
 
46
        int SMN=Code::GetIndex(Code::SPLIT_MERGE_NODE, nodeTypes);
 
47
 
 
48
        int DFL=Code::GetIndex(Code::DATA_FLOW, edgeTypes);
 
49
        int BDF=Code::GetIndex(Code::BIDIRECTIONAL_DATA_FLOW, edgeTypes);
 
50
 
 
51
        connections[EXT][EXT][DFL] = True;
 
52
        connections[EXT][EXT][BDF] = True;
 
53
 
 
54
        connections[DTF][DTF][DFL] = True;
 
55
        connections[DTF][STO][DFL] = True;
 
56
        connections[STO][DTF][DFL] = True;
 
57
        connections[DTF][EXT][DFL] = True;
 
58
        connections[EXT][DTF][DFL] = True;
 
59
        connections[STO][DTF][BDF] = True;
 
60
        connections[DTF][STO][BDF] = True;
 
61
        connections[DTF][SMN][DFL] = True;
 
62
        connections[SMN][DTF][DFL] = True;
 
63
        // connections[SMN][SMN][DFL] = True;
 
64
}