%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/Newman/lesmis
% name: Newman/lesmis
% [co-appearences of characters in Les Miserables by Victor Hugo]
% id: 2400
% date: 1993
% author: D. Knuth
% ed: M. Newman
% fields: name title A id date author kind notes aux ed
% aux: nodename
% kind: undirected weighted graph
%-------------------------------------------------------------------------------
% notes:
% Network collection from M. Newman                                          
% http://www-personal.umich.edu/~mejn/netdata/                               
%                                                                            
% The graph lesmis contains the weighted network of coappearances of         
% characters in Victor Hugo's novel "Les Miserables".  Nodes represent       
% characters as indicated by the labels and edges connect any pair of        
% characters that appear in the same chapter of the book.  The values on the 
% edges are the number of such coappearances.  The data on coappearances were
% taken from D. E. Knuth, The Stanford GraphBase: A Platform for             
% Combinatorial Computing, Addison-Wesley, Reading, MA (1993).               
%-------------------------------------------------------------------------------
