cfgh: a hypergroup for the control flow graph

A control flow graph (cfg) is a directed graph that represents all paths that might be traversed through a program during its execution. ##this graph is used to generate test cases for a program. in this paper, we define a hyper-operation on the vertex set of a cfg. consequently, it is proved that (1) the generated hyperstructure is a quasi-ordering hypergroup, (2) the connectivity in a cfg is equivalent to the inner irreducibility in the hypergroup, and (3) each sub-graph in a cfg is a sub-hypergroup