Matrix properties
number of rows	1,538
number of columns	1,538
nonzeros	8,032
# strongly connected comp.	1,028
explicit zero entries	0
nonzero pattern symmetry	5%
numeric value symmetry	5%
type	binary
structure	unsymmetric
Cholesky candidate?	no
positive definite?	no

author	Graph Drawing Contest
editor	V. Batagelj
date	2006
kind	directed graph
2D/3D problem?	no

Additional fields	size and type
nodename	full 1538-by-80

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/.                                
------------------------------------------------------------------------------
 GD 2006 contest graph C: Java Dependency graph                               
 http://gd2006.org/contest/details.php#java                                   
 graph in Pajek format                                                        
 transformed by Vladimir Batagelj, July 10, 2006                              

SVD-based statistics:
norm(A)	36.5008
min(svd(A))	0
cond(A)	Inf
rank(A)	744
null space dimension	794
full numerical rank?	no
singular value gap	8.9117e+12

singular values (MAT file):	click here
SVD method used:	s = svd (full (A)) ;
status:	ok

For a description of the statistics displayed above, click here.

Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.