|
|
|
| "be consistent" | |
| PerlMonks |
Re: How to compare two undirected graphs?by zentara (Cardinal) |
| on Oct 18, 2010 at 12:40 UTC ( [id://865924]=note: print w/replies, xml ) | Need Help?? |
|
The first thing that comes to mind is do a "least squares fit" analysis of the data points. Google for "perl least square fits". A pattern may emerge in the least square data. A decent example is at cpan example of least squares
I'm not really a human, but I play one on earth. Old Perl Programmer Haiku ................... flash japh
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||