Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!olivea!uunet!mcsun!ukc!edcastle!helium!aifh!fcs
From: fcs@aifh.ed.ac.uk (Flavio Soares Correa Da Silva)
Newsgroups: comp.lang.prolog
Subject: Re: Representing graphs?
Message-ID: <1991Jun27.094828@aifh.ed.ac.uk>
Date: 27 Jun 91 08:48:28 GMT
References: <ARI.HUTTUNEN.91Jun23021130@wonderwoman.hut.fi> <6505@goanna.cs.rmit.oz.au>
Sender: news@aifh.ed.ac.uk (Network News Administrator)
Reply-To: fcs@aifh.ed.ac.uk (Flavio Soares Correa Da Silva)
Distribution: comp
Organization: Dept of AI, University of Edinburgh, Scotland
Lines: 12

In article <6505@goanna.cs.rmit.oz.au>, ok@goanna.cs.rmit.oz.au (Richard A.
O'Keefe) writes:

# Another representation would be the
# adjacency matrix, represented as a quad-tree, which works rather
# nicely.

Could you explain this a bit more? 

Thanks,

Flavio (fcs@aipna.ed.ac.uk)