home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.compression
- Path: sparky!uunet!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!ealehman
- From: ealehman@athena.mit.edu (Eric A Lehman)
- Subject: digraph compression
- Message-ID: <1992Jul22.230017.1136@athena.mit.edu>
- Sender: news@athena.mit.edu (News system)
- Nntp-Posting-Host: e40-008-9.mit.edu
- Organization: Massachusetts Institute of Technology
- Date: Wed, 22 Jul 1992 23:00:17 GMT
- Lines: 6
-
- I would like to compress a directed graph, but still be able to
- determine whether one node points to another directly from the
- compressed file. Any suggestions?
-
- Eric Lehman
- ealehman@athena.mit.edu
-