function triangle_symq_rule_test03 ( degree, numnodes, vert1, vert2, vert3, ...
  filename )

%*****************************************************************************80
%
%% triangle_symq_rule_test03() calls triasymq_gnuplot() to generate graphics files.
%
%  Licensing:
%
%    This code is distributed under the GNU GPL license.
%
%  Modified:
%
%    09 June 2023
%
%  Author:
%
%    Original FORTRAN77 version by Hong Xiao, Zydrunas Gimbutas.
%    This version by John Burkardt.
%
%  Reference:
%
%    Hong Xiao, Zydrunas Gimbutas,
%    A numerical algorithm for the construction of efficient quadrature
%    rules in two and higher dimensions,
%    Computers and Mathematics with Applications,
%    Volume 59, 2010, pages 663-676.
%
%  Input:
%
%    integer DEGREE, the desired total polynomial degree exactness
%    of the quadrature rule.  0 <= DEGREE <= 50.
%
%    integer NUMNODES, the number of nodes to be used by the rule.
%
%    real VERT1(2), VERT2(2), VERT3(2), the
%    vertices of the triangle.
%
%    string filename: the name of the graphics file.
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'triangle_symq_rule_test03():\n' );
  fprintf ( 1, '  triasymq_gnuplot() creates gnuplot graphics files.\n' );
  fprintf ( 1, '  Polynomial exactness degree = %d\n', degree );

  [ rnodes, weights ] = triasymq ( degree, vert1, vert2, vert3, numnodes );

  fprintf ( 1, '  Number of nodes = %d\n', numnodes );

% triasymq_gnuplot ( vert1, vert2, vert3, numnodes, rnodes, header );

  triasymq_plot ( vert1, vert2, vert3, numnodes, rnodes, filename );

  return
end
