Re: The new GEDCOM parser

Hi Steve On 06/11/12 16:11, Stephen Woodbridge wrote: Hi Ron, I work with graphs for doing vehicle routing so have some familiarity with them. Good. I think this is the family of graph tool to look at using: http://search.cpan.org/~jhi/Graph/ Yes, that's the one I earlier said /I/ had

The Gedgrave Project

I'm putting together a website where you can upload a Gedcom (temporarily, it won't be stored) and the site will then give you links to the burial sites of your ancestors (where known). It does this by using the Gedcom CPAN module to parse the data, then it interrogates sites such as

Re: The new GEDCOM parser

Hi Ron, I totally agree with Jeremy, that the parser is the key. Obviously you need to supply it with test callbacks for verification as you build it. But once you have that then it should be straight forward for people (or you) to hook it into say Graph, or load it into a database or

Re: The new GEDCOM parser

Hi everybody! With a graph theory connection, you could easily implement Randy Wilson's ideas [1] on merging GEDCOMs. I've attempted to give thought to how this could be implemented with Graph.pm (as seen in O'Reilly's Algorithms with Perl) Gedcom.pm but I couldn't wrap my brain around the

Re: The new GEDCOM parser

Hi Chris On 07/11/12 06:27, Chris Clonch wrote: Hi everybody! With a graph theory connection, you could easily implement Randy Wilson's ideas [1] on merging GEDCOMs. I've attempted to give thought to how this could be implemented with Graph.pm (as seen in O'Reilly's Algorithms with Perl)