Hi, On Tue, Feb 07, 2012 at 06:53:43AM -0800, Martin Baker wrote: > to both finite and infinite graphs. However, at this stage, I don't > know how infinite graphs would be represented (presumably some > inductively defined data structure). Therefore I don't know how > vertices of the graph would be referred too, Well, think of Cayley graphs of finitely presented groups, infinite trees given by Gray codes, the Young lattice and other locally finite graphs which can be encoded into finite data. Functions like 'neighbours' or 'distance' 'edge?' have to be coded for every graph individually. Counting walks is perhaps the most important application. At the moment I only used them as a convenient way to pick finite subgraphs and operate on them. Infinite adjacency matrices (with finite rows and columns) as two-dimensional Streams could be the next step when the need arises. But this should go into InfiniteGraphCategory anyways.
regards, Franz -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
