Open jakobbossek opened 6 years ago
Function(s) which get two graphs or trees G1 = (V, E1) and G2 = (V, E2) and return the union graph H = (V, E1 cup E2) or H = (V, E1 cap E2. Should have runtime O(|V| + |E1| + |E2|), i.e., O(|V|) for (spanning) trees.
Working on this
Function(s) which get two graphs or trees G1 = (V, E1) and G2 = (V, E2) and return the union graph H = (V, E1 cup E2) or H = (V, E1 cap E2. Should have runtime O(|V| + |E1| + |E2|), i.e., O(|V|) for (spanning) trees.