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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
//
// File: test_graphObs.cpp
// Created by: Thomas Bigot
// Created on: 2016
//
/*
Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)
This software is a computer program whose purpose is to provide classes
for numerical calculus. This file is part of the Bio++ project.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#include "../src/Bpp/Graph/AssociationGraphImplObserver.h"
#include <vector>
#include <iostream>
using namespace bpp;
using namespace std;
int main() {
typedef AssociationGlobalGraphObserver<string,unsigned int> si_Graph;
si_Graph grObs(true);
shared_ptr<string> zero(new string("zero"));
shared_ptr<string> one(new string("one"));
shared_ptr<string> two(new string("two"));
shared_ptr<string> three(new string("three"));
shared_ptr<unsigned int> r3(new unsigned int(3));
shared_ptr<unsigned int> r2(new unsigned int(4));
cout << "Creating node zero." << endl;
grObs.createNode(zero);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
cout << "Creating node one from the number zero." << endl;
grObs.createNode(zero,one);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
cout << "Creating node two from the number one." << endl;
grObs.createNode(one,two);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
cout << "Linking two to zero." << endl;
grObs.link(two,zero,r3);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
cout << "Linking one to three." << endl;
grObs.createNode(one,three,r2);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
cout << "Linking three to zero." << endl;
grObs.link(three,zero);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
// so now we have zero -> one -> two -> zero ...
vector<shared_ptr<string> > fromZero = grObs.getOutgoingNeighbors(zero);
vector<shared_ptr<string> > fromTwo = grObs.getOutgoingNeighbors(two);
bool test = (*(fromZero.begin()) == one) && (*(fromTwo.begin()) == zero);
grObs.getGraph()->outputToDot(std::cout,"myTestDirGrObs");
cout << endl;
cout << "Iteration on all nodes:" << endl;
unique_ptr<si_Graph::NodeIterator> nIt=grObs.allNodesIterator();
for (;!nIt->end();nIt->next())
{
cout << ***nIt << endl;
}
cout << endl;
cout << "Iteration on all edges:" << endl;
unique_ptr<si_Graph::EdgeIterator> eIt=grObs.allEdgesIterator();
for (;!eIt->end();eIt->next())
{
cout << ***eIt << endl;
}
cout << endl;
cout << "Iteration on outgoing nodes neighbor of 1:" << endl;
unique_ptr<si_Graph::NodeIterator> on1It=grObs.outgoingNeighborNodesIterator(one);
for (;!on1It->end();on1It->next())
{
cout << ***on1It << endl;
}
cout << endl;
cout << "Iteration on incoming nodes neighbor of 0:" << endl;
unique_ptr<si_Graph::NodeIterator> in0It=grObs.incomingNeighborNodesIterator(zero);
for (;!in0It->end();in0It->next())
{
cout << ***in0It << endl;
}
cout << endl;
cout << "Iteration on outgoing edges neighbor of 1:" << endl;
unique_ptr<si_Graph::EdgeIterator> oe1It=grObs.outgoingEdgesIterator(one);
for (;!oe1It->end();oe1It->next())
{
cout << ***oe1It << endl;
}
cout << endl;
cout << "Iteration on incoming edges neighbor of 0:" << endl;
unique_ptr<si_Graph::EdgeIterator> ie0It=grObs.incomingEdgesIterator(zero);
for (;!ie0It->end();ie0It->next())
{
cout << ***ie0It << endl;
}
cout << endl;
cout << "Test const Iterator on all edges:" << endl;
const si_Graph& grObs_const=grObs;
unique_ptr<si_Graph::EdgeIterator> eIt_const=grObs_const.allEdgesIterator();
for (;!eIt_const->end();eIt_const->next())
{
cout << ***eIt_const << endl;
}
cout << endl;
return (test ? 0 : 1);
}
|
