GraphTheory - Maple Programming Help

Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/ConvertGraph

GraphTheory

 ConvertGraph

 Calling Sequence ConvertGraph(G, fmt) ConvertGraph(G)

Parameters

 G - representation of a graph in one of the allowed formats fmt - name of a format

Description

 • 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 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 graph6 or sparse6 representation of a graph (a string), or a bits representation of a graph (list of two integers).

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $\mathrm{g6}≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right),'\mathrm{graph6}'\right)$
 ${\mathrm{g6}}{≔}{"Ihe@GT@DG"}$ (1)
 > $\mathrm{s6}≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right),'\mathrm{sparse6}'\right)$
 ${\mathrm{s6}}{≔}{":IES@ocUgfeTF"}$ (2)
 > $b≔\mathrm{ConvertGraph}\left(\mathrm{PetersenGraph}\left(\right),'\mathrm{bits}'\right)$
 ${b}{≔}\left[{10}{,}{22854075843097}\right]$ (3)
 > $\mathrm{ConvertGraph}\left(\mathrm{g6},'\mathrm{sparse6}'\right)$
 ${":IES@ocUgfeTF"}$ (4)
 > $\mathrm{ConvertGraph}\left(\mathrm{s6}\right)$
 ${\mathrm{Graph 1: an undirected unweighted graph with 10 vertices and 15 edge\left(s\right)}}$ (5)