Single-entry single-exit
id:
single-entry-single-exit-262-6712901
title:
Single-entry single-exit
text:
In mathematics graph theory, a single-entry single-exit (SESE) region in a given graph is an ordered edge pair. For example, with the ordered edge pair, (a, b) of distinct control-flow edges a and b where: a dominates b
b postdominates a
Every cycle containing a also contains b and vice versa. where a node x is said to dominate node y in a directed graph if every path from start to y includes x. A node x is said to postdominate a node y if every path from y to end includes x. So, a and b refer t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Single-entry_single-exit
date created:
date modified:
2024-04-22T00:29:00Z
main entity:
{"identifier":"Q7523712","url":"https://www.wikidata.org/entity/Q7523712"}
image:
fields total:
13
integrity:
13