ConvertGraph converts its input graph G to the format fmt. If G is of type GRAPHLN, the second argument is mandatory and must be one of digraph6, graph6, sparse6, or bits. If G is not of type GRAPHLN, the second argument is optional, and can be either of the above formats as well as maple.

The input graph G can be a GraphTheory graph (GRAPHLN), a networks graph, a string whose value is a digraph6, graph6, or sparse6 representation of a graph, or a bits representation of a graph (list of two integers).

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

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

$\mathrm{d6}≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right)\,'\mathrm{digraph6}'\right)$

$\mathrm{g6}≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right)\,'\mathrm{graph6}'\right)$

$\mathrm{g6}≔''Ihe@GT@DG''$

$\mathrm{s6}≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right)\,'\mathrm{sparse6}'\right)$

$\mathrm{s6}≔'':I`ES@ocU`gfeTF''$

$b≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right)\,'\mathrm{bits}'\right)$

$b≔\left[10\,22854075843097\right]$

$\mathrm{ConvertGraph}\left(\mathrm{g6}\,'\mathrm{sparse6}'\right)$

$'':I`ES@ocU`gfeTF''$

$\mathrm{ConvertGraph}\left(\mathrm{s6}\right)$

$\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 10\; vertices\; and\; 15\; edges}$

The GraphTheory[ConvertGraph] command was updated in Maple 2017.