CopyGraph(G) creates a copy of the graph G.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$G≔\mathrm{CycleGraph}\left(5\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 5\; vertices\; and\; 5\; edge(s)}$

$H≔\mathrm{CopyGraph}\left(G\right)$

$H≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 5\; vertices\; and\; 5\; edge(s)}$

$\mathrm{AddEdge}\left(H\,\left\{\left\{1\,3\right\}\,\left\{1\,4\right\}\right\}\right)$

$\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 5\; vertices\; and\; 7\; edge(s)}$

$\mathrm{Edges}\left(G\right)$

$\left\{\left\{1\,2\right\}\,\left\{1\,5\right\}\,\left\{2\,3\right\}\,\left\{3\,4\right\}\,\left\{4\,5\right\}\right\}$

$\mathrm{Edges}\left(H\right)$

$\left\{\left\{1\,2\right\}\,\left\{1\,3\right\}\,\left\{1\,4\right\}\,\left\{1\,5\right\}\,\left\{2\,3\right\}\,\left\{3\,4\right\}\,\left\{4\,5\right\}\right\}$

$\left[\mathrm{SetVertexAttribute}\left(H\,2\,\mathrm{tag}=''vertex''\right)\right]$

$\mathrm{GetVertexAttribute}\left(H\,2\,\mathrm{tag}\right)$

$''vertex''$

$\mathrm{GetVertexAttribute}\left(G\,2\,\mathrm{tag}\right)$

$\mathrm{FAIL}$