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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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.
*
*/
#include "Distances.h"
#include <tulip/tuliphash.h>
#include <tulip/MutableContainer.h>
using namespace tlp;
using namespace std;
unsigned int getDist(Graph *g, node n1, node n2) {
vector<node> nextNodes;
TLP_HASH_MAP<node, unsigned int> nodeDepth;
MutableContainer<bool> alreadyTreated;
bool found = false;
alreadyTreated.setAll(false);
nextNodes.push_back(n1);
nodeDepth[n1]=0;
alreadyTreated.set(n1.id,true);
for(unsigned int i = 0 ; !found && i < nextNodes.size(); ++i) {
node current = nextNodes[i];
Iterator<node> * itn = g->getInOutNodes(current);
while(itn->hasNext()) {
node v = itn->next();
if(alreadyTreated.get(v.id))
continue;
alreadyTreated.set(v.id,true);
nextNodes.push_back(v);
nodeDepth[v] = nodeDepth[current]+1;
if(v == n2) {
found = true;
break;
}
}
delete itn;
}
return nodeDepth[n2];
}
|
