stc
“Good Will Hunting” problem
Mathematics
In mathematics, graphs are structures that represent pairwise relationships between objects. In more detail, graphs consist of a finite set of vertices (or nodes) and a set of edges which connect pairs of vertices. Follow the instructions and figure out a solution to the problem solved by the main character in the movie Good Will Hunting. Be careful, some graphs can be drawn differently but are equivalent. Can you distinguish them?
stc