Matrix properties
number of rows	1,538
number of columns	1,538
nonzeros	8,032
structural full rank?	no
structural rank	759
# of blocks from dmperm	204
# 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                              

Ordering statistics:	AMD	METIS
nnz(chol(P*(A+A'+s*I)*P'))	25,548	27,471
Cholesky flop count	1.6e+06	1.6e+06
nnz(L+U), no partial pivoting	49,558	53,404
nnz(V) for QR, upper bound nnz(L) for LU	87,769	57,298
nnz(R) for QR, upper bound nnz(U) for LU	34,683	35,976

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