|RACSODFACFGOperations: Reg, CFPDAReductions: K, WP, CFG, NP, SATANTLR: lexical, syntacticExams||log in, register, become guest|
n1: int n2: int E1: array of array  of int E2: array of array  of int k: intThe input contains the numbers of nodes and the lists of edges of the graphs and , respectively, with , and the number of edges that must be aligned. Each edge of the graph appears in the list exactly once, with the nodes in no particular order, nodes being identified with a number in .
mapping: array of intThe output is an array mapping where its ’th position denotes the node of assigned to the node of . The array should contain elements, each with a value in , without repeated entries.