: The new GEDCOM parser
Ron,
I think this is a graph not a tree or at best an interconnect forest of
trees. Given a focus node like an individual or a family you can view
look
at the trees up or down from that node.
In graph theory you have nodes and edges, and you can use Dijkstra's
shortest path
: Stephen Woodbridge [mailto:wood...@swoodbridge.com]
Sent: Monday, November 05, 2012 6:23 PM
To: perl-gedcom@perl.org
Subject: Re: The new GEDCOM parser
Ron,
I think this is a graph not a tree or at best an interconnect forest of
trees. Given a focus node like an individual or a family you can view
their implementation.
-Original Message-
From: Stephen Woodbridge [mailto:wood...@swoodbridge.com]
Sent: Monday, November 05, 2012 6:23 PM
To: perl-gedcom@perl.org
Subject: Re: The new GEDCOM parser
Ron,
I think this is a graph not a tree or at best an interconnect
forest of
trees
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)
? Or are
you thinking the tree would represent the family relationships? I don't
see how the later will work.
-Steve
On 11/5/2012 2:04 AM, Ron Savage wrote:
Hi
The new GEDCOM parser
This document is a collection of ideas which have been percolating
in my mind for a long time.
Comments
:42 AM
Subject: The new GEDCOM parser
Hi
The new GEDCOM parser
This document is a collection of ideas which have been percolating
in my mind for a long time.
Comments welcome.
Ideas
Module name
Genealogy::Gedcom::Parser.
A place-holder, Genealogy::Gedcom
http://metacpan.org/release/Genealogy
to
divorce/re-marriage/adoption/...
Still, whatever the data structure chosen, /something/ has to be chosen
just to hold the data in memory.
-Steve
On 11/5/2012 2:04 AM, Ron Savage wrote:
Hi
The new GEDCOM parser
This document is a collection of ideas which have been percolating
in my mind for a long
-marriage/adoption/...
Still, whatever the data structure chosen, /something/ has to be
chosen just to hold the data in memory.
-Steve
On 11/5/2012 2:04 AM, Ron Savage wrote:
Hi
The new GEDCOM parser
This document is a collection of ideas which have been percolating
in my mind for a long time
You seem to be mixing two paradigms here: a stream parsing engine
(having all the callbacks per entity) and a document model builder. I
recommend to focus on making a solid GEDCOM stream parser (handling
UTF-8, well-defined grammar). There are many applications that don't
need to hold all the
Hi Jeremy
On 06/11/12 17:54, Jeremy Slade wrote:
You seem to be mixing two paradigms here: a stream parsing engine
(having all the callbacks per entity) and a document model builder. I
recommend to focus on making a solid GEDCOM stream parser (handling
UTF-8, well-defined grammar). There are
10 matches
Mail list logo