Loading ...
Sorry, an error occurred while loading the content.


Expand Messages
  • Brandon Corfman
    Sep 4, 2003
    • 0 Attachment
      The graph-search and tree-search algorithms in chapter 3 of the 2nd
      edition use a "fringe" variable to maintain the queue of nodes. Does
      anyone know why the word "fringe" is used to describe this? The 1st
      edition talked about a queue instead (actually, an "enqueue" function)
      and I thought that terminology was more straightforward. Does the word
      "fringe" have a more specific meaning than queue?

    • Show all 3 messages in this topic