Romance dating with breadth or depth search algorithms

Graphic by Darrion Chen / The Daily Pennsylvanian

Note that while you’re in college, you have access to the largest dating pool you’ll likely ever have in your life. As such, it is absolutely imperative that you use the search algorithm that best suits your needs. In this article, we’ll explore the pros and cons of deep-seeking versus deep-seeking as it applies to your love life.

First, it’s important to note that we describe the dating pool as a tree. The root of the tree is you, and the nodes in the next layer are your potential interests. Their leaf nodes are all characteristics and traits of that respective person, which are initially unknown to you. Note that by the definition of a tree, there are no cycles. Your goal is to investigate each person and their child nodes and therefore obviously find the right person.

Traditional dating strategy uses a depth-first strategy. This is where you commit to a knot and seek its full depth down to the final layer. The advantage of this strategy is that it requires less memory since you are only committed to one node. If you can’t find the solution in that person after going through all of their leaf nodes, then you move on to the sibling node. Although this is the traditional method of dating, it can be relatively slower to expand first depending on your needs.

Meanwhile, breadth dating casts a wide net, but has much worse spatial complexity. Before, you only spoke to one person at a time? Now try 5, 10, or even 20. Because of the definition of BFS dating, you’ll get to the same basics with your 20 people around the same time, which can get confusing. Then again, if you say the wrong name in the room, you’ll still get 19 other people, so whether you think that’s an effective strategy is up to you. This strategy is otherwise known as “whoring”, but who is going to judge you if this strategy gives you the right one.

But the algorithm you use really depends on the depth of your research. Do you really only care about one or two superficial traits, like looks or money? In this case, use width first, because from a large pool you’ll probably find a suitable solution fairly quickly, since you’re not interested in deeper strokes. You can even find multiple solutions, which isn’t a bad problem either.

However, if you’re interested in deeper details, like their darkest secrets or toothbrush color preference, deep searching is the best bet. The explanation for this one is quite simple: will you be able to memorize 20 people’s childhood secrets at the same time?

In summary, either search algorithm is entirely valid depending on your needs and requirements. Therefore, it is important that you first decide what your needs and requirements are before choosing a strategy for yourself.

Sharon D. Cole