Skip to Content
Event Information
Author's profile photo Susen Poppe
Susen Poppe
June 22, 2022 1 minute read

SAP HANA Cloud Graph challenge 2022 | The winners are…

Dear SAP Community,

As you may already know, we’ve launched the very first SAP HANA Cloud Graph challenge  in May 2022.

On behalf of the entire SAP HANA Cloud graph challenge team and the SAP HANA product management team, congratulations to all the participants who accepted the challenge and took the time to submit their solution!

Now, we are excited to announce that the winners of the SAP HANA Cloud graph challenge 2022 are:

A big thank you for all contributions! Keep up the good work and your excitement for SAP HANA Cloud’s graph capabilities!

 

Prizes

Apart from learning more about the graph functionality in SAP HANA Cloud, the chosen winners get the opportunity to present their solution in an SAP Community call together with our SAP HANA Graph experts!

Winners will be contacted shortly to clarify the details of the SAP Community call.

 

What’s next?

Stay tuned for upcoming events, including the SAP Community Call with the winners of this challenge, by following our product tag in the SAP Community.

Did you stumble about this blogpost without having participated in the challenge? Don’t worry, you can still accept the challenge and try to help the two friends to find the building that is in the closest walking distance for both. You can find possible solutions in the comments below this blogpost.

 

For more information about SAP HANA Cloud:

 

Your SAP HANA Cloud graph challenge team

Assigned Tags

      2 Comments
      You must be Logged on to comment or reply to a post.
      Author's profile photo Susen Poppe
      Susen Poppe
      Blog Post Author

      Please find the possible solutions below:

      1.) Strategy „minimal effort“ -  lowest value for p1+2

      Best solution: WDF02 (p1=865.033; p2=554.833)

      Drawback: is not “fair” since p1 is longer than p2

      2.) strategy “most fair” – smallest difference between p1 and p2

      Best solution: WDF49 (p1=861.924; p2=824.545)

      Drawback: both need to walk a long distance

      3.) strategy “minimize the longer path” – lowest value for the longer of both paths

      Best solution: WDF04 (p1=682.649; p2=771.873)

      Author's profile photo Mathias KEMETER
      Mathias KEMETER

      Congratulations Paul Pfeiffer and Alexandre de Andrade! Great work!