%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/Newman/adjnoun
% name: Newman/adjnoun
% [Common adjective and nouns in "David Copperfield"]
% id: 2389
% date: 2006
% author: M. Newman
% ed: M. Newman
% fields: name title A id date author kind notes aux ed
% aux: nodename nodevalue
% kind: undirected graph
%-------------------------------------------------------------------------------
% notes:
% Network collection from M. Newman                                          
% http://www-personal.umich.edu/~mejn/netdata/                               
%                                                                            
% The graph adjnoun contains the network of common adjective and noun        
% adjacencies for the novel "David Copperfield" by Charles Dickens, as       
% described by M. Newman.  Nodes represent the most commonly occurring       
% adjectives and nouns in the book.  Node values are 0 for adjectives and 1  
% for nouns.  Edges connect any pair of words that occur in adjacent position
% in the text of the book.  Please cite M. E. J. Newman, Finding community   
% structure in networks using the eigenvectors of matrices, Preprint         
% physics/0605087 (2006).                                                    
%-------------------------------------------------------------------------------
