22:
311:
258:
The first two conditions are necessary but not enough to characterize SESE regions: since backedges do not alter the dominance or postdominance relationships, the first two conditions alone do not prohibit backedges entering or exiting the
32:
352:
90:
62:
69:
47:
76:
123:
376:
58:
251:
The second condition ensures that every path from inside the region to end passes through the region’s exit edge,
345:
244:
The first condition ensures that every path from start into the region passes through the region’s entry edge,
371:
83:
338:
262:
The third condition encodes two constraints: every path from inside the region to a point 'above'
138:
322:
39:
198:
365:
318:
115:
112:
21:
294:
310:
295:
The program structure tree: computing control regions in linear time
15:
326:
43:
240:refer to the entry and exit edge, respectively.
346:
8:
274:to a point inside the region passes through
48:introducing citations to additional sources
353:
339:
129:For example, with the ordered edge pair, (
38:Relevant discussion may be found on the
287:
229:.
270:, and every path from a point 'below'
7:
307:
305:
325:. You can help Knowledge (XXG) by
14:
309:
31:relies largely or entirely on a
20:
120:single-entry single-exit (SESE)
1:
201:if every path from start to
393:
304:
59:"Single-entry single-exit"
126:is an ordered edge pair.
173:Every cycle containing
321:-related article is a
44:improve this article
221:if every path from
377:Graph theory stubs
122:region in a given
334:
333:
109:
108:
94:
384:
355:
348:
341:
313:
306:
297:
292:
225:to end includes
104:
101:
95:
93:
52:
24:
16:
392:
391:
387:
386:
385:
383:
382:
381:
362:
361:
360:
359:
302:
300:
293:
289:
285:
266:passed through
181:and vice versa.
170:
160:
105:
99:
96:
53:
51:
37:
25:
12:
11:
5:
390:
388:
380:
379:
374:
364:
363:
358:
357:
350:
343:
335:
332:
331:
314:
299:
298:
286:
284:
281:
280:
279:
260:
256:
249:
199:directed graph
183:
182:
177:also contains
171:
166:postdominates
161:
137:) of distinct
107:
106:
42:. Please help
28:
26:
19:
13:
10:
9:
6:
4:
3:
2:
389:
378:
375:
373:
370:
369:
367:
356:
351:
349:
344:
342:
337:
336:
330:
328:
324:
320:
315:
312:
308:
303:
296:
291:
288:
282:
277:
273:
269:
265:
261:
257:
254:
250:
247:
243:
242:
241:
239:
235:
230:
228:
224:
220:
216:
212:
208:
204:
200:
196:
192:
188:
185:where a node
180:
176:
172:
169:
165:
162:
159:
155:
152:
151:
150:
148:
144:
140:
136:
132:
127:
125:
121:
117:
114:
103:
92:
89:
85:
82:
78:
75:
71:
68:
64:
61: –
60:
56:
55:Find sources:
49:
45:
41:
35:
34:
33:single source
29:This article
27:
23:
18:
17:
372:Graph theory
327:expanding it
319:graph theory
316:
301:
290:
275:
271:
267:
263:
252:
245:
237:
233:
231:
226:
222:
218:
215:postdominate
214:
210:
206:
202:
194:
190:
186:
184:
178:
174:
167:
163:
157:
153:
146:
142:
139:control-flow
134:
130:
128:
119:
116:graph theory
110:
97:
87:
80:
73:
66:
54:
30:
213:is said to
189:is said to
113:mathematics
366:Categories
283:References
156:dominates
100:April 2024
70:newspapers
209:. A node
205:includes
40:talk page
191:dominate
259:region.
217:a node
149:where:
133:,
84:scholar
141:edges
86:
79:
72:
65:
57:
317:This
197:in a
193:node
124:graph
91:JSTOR
77:books
323:stub
236:and
232:So,
145:and
118:, a
63:news
111:In
46:by
368::
354:e
347:t
340:v
329:.
278:.
276:a
272:b
268:b
264:a
255:.
253:b
248:.
246:a
238:b
234:a
227:x
223:y
219:y
211:x
207:x
203:y
195:y
187:x
179:b
175:a
168:a
164:b
158:b
154:a
147:b
143:a
135:b
131:a
102:)
98:(
88:·
81:·
74:·
67:·
50:.
36:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
