1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Easy graph theory question: maximise sum of visited nodes

  1. Apr 23, 2010 #1
    1. The problem statement, all variables and given/known data

    Starting in the bottom left corner and moving either up or right, one square at a time, adding up the numbers along the way, what is the largest sum that can be made once you have reached the top right corner


    142212
    431343
    214212
    122331
    413121
    314342
    211113
    342322



    This is from an "intro to computer science" course. My prof was a bit of a lazy bastard and just threw these random technical questions into the mix with the knowledge questions without giving us homework solutions or anything you could call teaching beyond, "it's just graph theory" in class.



    2. Relevant equations



    3. The attempt at a solution


    no idea.



    Thanks for looking.
     
    Last edited: Apr 23, 2010
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted



Similar Discussions: Easy graph theory question: maximise sum of visited nodes
  1. Graph theory question (Replies: 0)

  2. Graph theory question (Replies: 1)

Loading...