{
    matrix_id: '1475',
    name: 'GD00_a',
    group: 'Pajek',
    description: 'Pajek network: Graph Drawing contest 2000',
    author: 'Graph Drawing Contest',
    editor: 'V. Batagelj',
    date: '2000',
    kind: 'directed graph',
    problem_2D_or_3D: '0',
    num_rows: '352',
    num_cols: '352',
    nonzeros: '458',
    num_explicit_zeros: '0',
    num_strongly_connected_components: '352',
    pattern_symmetry: '0.000',
    numeric_symmetry: '0.000',
    rb_type: 'binary',
    structure: 'unsymmetric',
    cholesky_candidate: 'no',
    positive_definite: 'no',
    notes: '------------------------------------------------------------------------------
Pajek network converted to sparse adjacency matrix for inclusion in UF sparse 
matrix collection, Tim Davis.  For Pajek datasets, See V. Batagelj & A. Mrvar,
http://vlado.fmf.uni-lj.si/pub/networks/data/.                                
------------------------------------------------------------------------------
The original problem had 3D xyz coordinates, but all values of z were equal   
to 0.5, and have been removed.  This graph has 2D coordinates.                
',
    aux_fields: 'nodename: full 352-by-96
coord: full 352-by-2
',    norm: '7.082111e+00',
    min_singular_value: '0',
    condition_number: 'Inf',
    svd_rank: '178',
    null_space_dimension: '174',
    full_numerical_rank: 'no',
    svd_gap: '129722925881091.437500',
    image_files: 'GD00_a.png,GD00_a_gplot.png,GD00_a_scc.png,GD00_a_svd.png,GD00_a_APlusAT_graph.gif,GD00_a_graph.gif,',
}
