  
  [1X3 [33X[0;0YNauty Traces Interface[133X[101X
  
  
  [1X3.1 [33X[0;0YData Structures[133X[101X
  
  [1X3.1-1 NautyGraphFromEdges[101X
  
  [33X[1;0Y[29X[2XNautyGraphFromEdges[102X( [3Xedges[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10Ya list of two lists[133X
  
  [33X[0;0YThis  function takes as input a list [3Xedges[103X whose entries are lists of length
  2,  consisting of the two (possibly equal) vertices of the edges. It returns
  two  lists,  the first is a list of vertices (source vertices) where an edge
  originates  and the second a list of corresponding vertices (range vertices)
  where an edge terminates. Note that when the graph is undirected, the source
  vertex will always be less than or equal to the range.[133X
  
  [4X[32X  Example  [32X[104X
    [4X[25Xgap>[125X [27Xng := NautyGraph( [ [1,2], [2,3], [3,4], [4,1], [3,2] ]);    [127X[104X
    [4X[28X<A Nauty graph with on 4 vertices>[128X[104X
    [4X[25Xgap>[125X [27XNautyGraphFromEdges( EdgesOfNautyGraph(ng));[127X[104X
    [4X[28X[ [ 1, 1, 2, 3 ], [ 2, 4, 3, 4 ] ][128X[104X
    [4X[25Xgap>[125X [27Xng := NautyDiGraph( [ [1,2], [2,3], [3,4], [4,1], [3,2] ]);[127X[104X
    [4X[28X<A directed Nauty graph on 4 vertices>[128X[104X
    [4X[25Xgap>[125X [27XNautyGraphFromEdges( EdgesOfNautyGraph(ng));               [127X[104X
    [4X[28X[ [ 1, 2, 3, 3, 4 ], [ 2, 3, 2, 4, 1 ] ][128X[104X
  [4X[32X[104X
  
  [1X3.1-2 NautyColorData[101X
  
  [33X[1;0Y[29X[2XNautyColorData[102X( [3Xlist[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10Ytwo lists[133X
  
  [33X[0;0YThis  function  takes  as  input  a  list of colours, which are non-negative
  integers.  The list is interpreted as a map from the nodes of a graph to the
  colour  of  the  node. This function returns two lists, called [3Xnode_list[103X and
  [3Xcolor_list[103X.  The  list [3Xnode_list[103X is a permutation of the nodes sorted by the
  colour  of  the  node  as specified in the input. The second list [3Xcolor_list[103X
  contains only [22X0,1[122X. The two lists together encode the colour partition of the
  nodes,   namely  the  list  [3Xcolor_list[103X  contains  a  [22X0[122X  in  position  [22Xi[122X,  if
  [3Xnode_list[103X[22X[i][122X  and  [3Xnode_list[103X[22X[i+1][122X have different colours. Thus, if the first
  entry  [22X0[122X  in  [3Xcolor_list[103X  occurs  in  position  [22Xj[122X,  then the nodes stored in
  [3Xnode_list[103X[22X[k][122X for [22X1 ≤ k ≤ j[122X all have colour [3Xlist[103X[22X[1][122X.[133X
  
