Class BreadthFirst

java.lang.Object
org.drip.graph.search.BreadthFirst

public class BreadthFirst
extends java.lang.Object
BreadthFirst implements the Iterative Breadth-first Search Schemes. The References are:

  • Aziz, A., and A. Prakash (2010): Algorithms for Interviews http://users.ece.utexas.edu/~adnan/afi-samples-new.pdf
  • Coppin, B. (2004): Artificial Intelligence Illuminated Jones and Bartlett Learning
  • Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
  • Russell, S., and P. Norvig (2003): Artificial Intelligence: Modern Approach 2nd Edition Prentice Hall
  • Wikipedia (2020): Breadth-first Search https://en.wikipedia.org/wiki/Breadth-first_search




Author:
Lakshmi Krishnamurthy
  • Constructor Summary

    Constructors
    Constructor Description
    BreadthFirst​(Network network)
    BreadthFirst Constructor
  • Method Summary

    Modifier and Type Method Description
    Network network()
    Retrieve the Graph Network
    boolean nonRecursive​(java.lang.String vertexName, OrderedVertexGroup orderedVertexGroup)
    Generate the Vertex Set using a Non-recursive Breadth-First Search

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Constructor Details

    • BreadthFirst

      public BreadthFirst​(Network network) throws java.lang.Exception
      BreadthFirst Constructor
      Parameters:
      network - Graph Network
      Throws:
      java.lang.Exception - Thrown if the Inputs are Invalid
  • Method Details

    • network

      public Network network()
      Retrieve the Graph Network
      Returns:
      The Graph Network
    • nonRecursive

      public boolean nonRecursive​(java.lang.String vertexName, OrderedVertexGroup orderedVertexGroup)
      Generate the Vertex Set using a Non-recursive Breadth-First Search
      Parameters:
      vertexName - Vertex Name
      orderedVertexGroup - The Ordered Vertex Group
      Returns:
      The Vertex Set using a Non-recursive Breadth-First Search