Editing 2015 Jan Gold Problem 3 Grass Cownoisseur (section)

== Problem ==

The problem involves a directed graph representing fields (nodes) and paths (edges) connecting the fields. Every field has a certain quantity of grass (a value). The task is to find the maximum total quantity of grass a cow can eat if the cow starts from any field, moves along the paths, and cannot go through any path more than once. The cow can continue moving as long as it has not yet traversed all fields it can reach without reusing a path.