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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 2011 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM 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.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Class
Foam::router
Description
Lee's PCB routing algorithm. Construct with list of connections between
nodes (i.e. topology) and list of coordinates of nodes (can be vector::zero)
Use e.g.
// Enter topology/geometry
router cellRouter
(
mesh().cellCells(),
mesh().cellCentres()
);
// Try to route connections one by one. Specify unique value (<0) to
// mark path with.
forAll(wantedConnections, i)
{
bool success = cellRouter.route(wantedConnections[i], -(i+1));
}
The coordinates are only used at the moment for diagonal preference of
routing:
So not:
+A
|
|
|
|
------+B
But:
+ A
|_
|_
|_
|_
|
+ B
Lee algo: take array with same dimensions as grid of nodes. Initialize to
large number. Put 0 at starting point. Now recursively assign neighbours
as current value plus one. Stop if you hit node which has smaller number.
Phase two is where you search path with lowest value. These are assigned
negative number so they for next route are not overwritten.
SourceFiles
router.C
\*---------------------------------------------------------------------------*/
#ifndef router_H
#define router_H
#include "labelList.H"
#include "pointField.H"
#include "DynamicList.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
// Forward declaration of classes
/*---------------------------------------------------------------------------*\
Class router Declaration
\*---------------------------------------------------------------------------*/
class router
{
// Private data
//- Connections
const labelListList connections_;
//- Coordinates of nodes
const pointField coords_;
//- Routing table
labelList weights_;
// Private Member Functions
//- Return number of weights. Utility function
label count(const label weight) const;
//- Set distance from nodeI
void setWeights
(
const label weight,
const label nodeI
);
//- Finds path from nodeI to startNodeI by travelling in direction
// of lowest weight
void fixWeights
(
const label startNodeI,
const label endNodeI,
const label nodeI,
const label prevNodeI
);
//- Routes single path
bool shortestPath
(
const labelList& path,
const label pathValue
);
//- Linear search for element with weight
label getValue(const label) const;
//- Find node which has no neighbours with pathValue
label findEndNode
(
const label startNodeI,
const label prevNodeI,
const label pathValue
) const;
//- Append all pathValue weights to route.
void storeRoute
(
const label startNodeI,
const label prevNodeI,
const label pathValue,
DynamicList<label>& route
) const;
//- Disallow default bitwise copy construct
router(const router&);
//- Disallow default bitwise assignment
void operator=(const router&);
public:
// Constructors
//- Construct from connections, route later.
router
(
const labelListList& connections,
const List<point>& coords
);
// Member Functions
// Access
const labelList& weights() const
{
return weights_;
}
// Edit
//- Find path from first element in path to all other elements
// Mark resulting path in weights with (negative) pathValue.
// Returns false and does not mark any elements if cannot route.
bool route(const labelList& path, const label pathValue);
//- Extract labels of route with given value.
labelList getRoute(const label pathValue) const;
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************************************************************* //
|
