RACSODFACFGOperations: Reg, CFPDAReductions: K, WP, CFG, NP, SATANTLR: lexical, syntacticExams  log in, register, become guest 
n1: int n2: int E1: array of array [2] of int E2: array of array [2] of int k: intThe input contains the numbers $n_1,n_2$ of nodes and the lists $E_1,E_2$ of edges of the graphs $G_1$ and $G_2$, respectively, with $n_1\leq n_2$, and the number $k$ of edges that must be aligned. Each edge of the graph $G_i$ appears in the list $E_i$ exactly once, with the nodes in no particular order, nodes being identified with a number in $\{0,\ldots,n_i1\}$.
mapping: array of intThe output is an array mapping where its $i$’th position denotes the node of $G_2$ assigned to the node $i$ of $G_1$. The array should contain $n_1$ elements, each with a value in $\{0,\ldots,n_21\}$, without repeated entries.
