Bipartite Graphs: A Functional Approach to Solving the Conundrum

I was recently introduced to a concept in graph theory called bipartite graphs. A bipartite graph is essentially a graph where no node (vertex) has an odd number of hops back to itself (cycles). Wikipedia defines it this way: a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in Essentially, you divide a graph...

What is Functional Programming?

Functional Programming is Mathematical Programming Functional programming (FP) is programming with functions. Seems simple! However, function is this case not the same as a traditional function in Java, C++, or most other programming languages. Those functions are more like procedures than true functions. Think back to high school algebra (unless you are in high school, then kudos to you for...