Re: Maze searching problem

Article View: comp.theory

Article #1958

#1958

From: Crocker
Date: Thu, 07 Apr 1988 14:03

11 lines
642 bytes

Is n the number of vertices in the graph (v), number of edges in
the graph (e), number of *things* in the graph (v+e), or something
completely different?

Ron Crocker
AT&T Bell Laboratories
(312) 416-5262
-- 
Ron Crocker
IHP 1A-213
x5262

Technical Details

Message-ID: <4315@ihlpf.ATT.COM>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!ncc!alberta!att-ih!ihnp4!ihlpf!crocker

References: <2119@svax.cs.cornell.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!ncc!alberta!att-ih!ihnp4!ihlpf!crocker
From: crocker@ihlpf.ATT.COM (Crocker)
Newsgroups: comp.theory
Subject: Re: Maze searching problem
Message-ID: <4315@ihlpf.ATT.COM>
Date: 7 Apr 88 14:03:46 GMT
References: <2119@svax.cs.cornell.edu>
Organization: AT&T Bell Laboratories - Naperville, Illinois
Lines: 11
Keywords: maze, space bound
Summary: What is n?

Reply to Parent Message