Despite the explosive new interest in Distributed Computing, bringing software - particularly legacy software - to parallel platforms remains a daunting task. The Self Distributing Associative Architecture (SDAARC) takes a two-fold approach to this problem. Seemingly sequential programs are first translated into a population of migratory threads and containers by the compiler, and then allowed to migrate to minimize communication while maximizing parallelism by a run time environment.However, previous compilers for multithreaded architectures such as SDAARC did not permit the full range of control flow complexity found in programming languages such as C. Thus, we propose a new data structure, and present algorithms for its construction, which extends the familiar concepts of control flow and dataflow graphs to conveniently represent the activities required of an automatically generated thread.