Home/ Questions/Q 443835
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-12T21:12:38+00:00

First yes, this is a homework project for my Perl class. I am not

  • 0

First yes, this is a homework project for my Perl class. I am not looking for the answer (although that would be sweet). As I understand it I need to use a BFS and a regular expression to organize my data for use. I need some direction on this one. How do I use a BFS? Do I use a massive stack and go through each item in the stack? Should I use a giant hash table? Has anyone worked on this problem? How did you go about doing it? I just need some direction is all. Is this similar to a BST? Is this possible without using the graph module? Is this possible using hash values?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This isn’t an answer, but it’s hints towards your answer.

    You are best served by first looking up what a Breadth First Search is in a graph.

    Also, if you have not been given a regular expression, you may consider the tokenizing problem and look that up. Possibly that won’t be needed. Check the assignment and see if you can just slurp in some information.

    • 0