Parallel breadth first search algorithm


	/-/S'pht-Translator-Active/-/

Parallel breadth first search algorithm

Posted By: ehyto Date: 12/20/25 5:13 a.m.

If I am not mistaken, the Aleph One Vistree is like breadth first search?
Parallel process the visible portals at each level of the graph.
Groups of portals processed at each level of the graph until all visible portals are processed.
The graph is from visible portals.
I never even asked if Aleph One is multithreaded.

[ Post a Reply | Message Index | Read Prev Msg | Read Next Msg ]
Pre-2004 Posts

Your Name:
Your E-Mail Address:
Subject:
Message:
: If I am not mistaken, the Aleph One Vistree is like breadth first search? : Parallel process the visible portals at each level of the graph. : Groups of portals processed at each level of the graph until all visible : portals are processed. : The graph is from visible portals. : I never even asked if Aleph One is multithreaded.

If you'd like to include a link to another page with your message,
please provide both the URL address and the title of the page:
Optional Link URL:
Optional Link Title:

If necessary, enter your password below:
Password:

Problems? Suggestions? Comments? Email maintainer@bungie.org
Marathon's Story Forum is maintained with WebBBS 5.12.



	Your Name:
	Your E-Mail Address:
	Subject:
	Message: : If I am not mistaken, the Aleph One Vistree is like breadth first search? : Parallel process the visible portals at each level of the graph. : Groups of portals processed at each level of the graph until all visible : portals are processed. : The graph is from visible portals. : I never even asked if Aleph One is multithreaded.
	If you'd like to include a link to another page with your message, please provide both the URL address and the title of the page:
	Optional Link URL:
	Optional Link Title:
	If necessary, enter your password below:
	Password: