🏆 Welcome to the GraphAcademy Cup Community Challenge

Welcome to the GraphAcademy Cup Community Challenge

Learn. Build. Share. Win.

:soccer_ball: How to Play

1. Join the GraphAcademy Cup

Before you can participate in the Community Challenge, you'll need to join the GraphAcademy Cup and represent your country.

:backhand_index_pointing_right: Join the GraphAcademy Cup

Register for the GraphAcademy Cup and join your country team.

2. Complete a GraphAcademy Course

Take any GraphAcademy course during the competition period and learn new graph skills.

:backhand_index_pointing_right: Browse GraphAcademy Courses

3. Build Something Inspired by What You Learned

Create a project that applies concepts, techniques, or ideas you learned in GraphAcademy.

4. Submit Your Project

Each submission must include:

GraphAcademy Cup Team URL

Paste the URL of your country team page from the GraphAcademy Cup.

GraphAcademy Public Profile Username

Provide your GraphAcademy Public Profile Username so we can verify your participation in the GraphAcademy Cup.

Project Details

Tell us:

  • Which GraphAcademy course you completed
  • What concept or lesson inspired your project
  • What you built
  • How you applied what you learned

:stop_sign: No qualified Aura Agent Hackathon submissions can be resubmitted.
You may also include:

  • Screenshots
  • GitHub repositories
  • Demo links
  • Videos
  • Additional documentation

:warning: Anonymous GraphAcademy profiles are welcome to participate and receive community feedback, but are not eligible for weekly LEGO prizes or winner selection.

5. Get Feedback and Votes

Community members can:

  • View your project
  • Ask questions
  • Provide feedback
  • Like and support submissions

6. Win Weekly LEGO Prizes

Each week we'll select outstanding submissions to receive a LEGO prize and be featured in the Community Hall of Fame.

As the tournament progresses, the LEGO prizes may get bigger and more exciting.


Anonymous Profiles

Anonymous GraphAcademy profiles may participate in the Community Challenge, share projects, and receive community feedback.

However, anonymous profiles are not eligible for weekly LEGO prizes or winner selection.

Neo4j may verify participant eligibility before awarding prizes.


:sports_medal: Judging Criteria

Projects may be evaluated on:

  • Learning applied from GraphAcademy
  • Creativity
  • Project quality
  • Community engagement
  • Clarity of explanation

Community feedback and likes may also be considered during winner selection.


:rocket: Getting Started

  1. Join the GraphAcademy Cup
  2. Join your country team
  3. Complete a GraphAcademy course
  4. Build something inspired by what you learned
  5. Click New Topic
  6. Include your Team URL and Public Profile Username
  7. Submit your project
  8. Engage with other participants and support your favorites

Then visit the pinned :trophy: Week 1 Challenge topic for inspiration, deadlines, and contest updates.


:scroll: Contest Rules

  • :link: :wrapped_gift: One LEGO prize winner will be selected every week during the GraphAcademy Cup! ( See Terms & Conditions and FAQ )

  • One submission topic per person / project (cannot be resubmitted the following)

  • Projects should be related to concepts learned in GraphAcademy course.

  • All submissions must follow the Neo4j Community Guidelines

  • Community likes and engagement may be considered during judging

  • Winners may be asked to verify eligibility before prizes are awarded

  • Neo4j reserves the right to modify, suspend, or end the contest if necessary


:wrapped_gift: Prize Eligibility

To be eligible for weekly LEGO prizes, participants must:

:white_check_mark: Be registered for the GraphAcademy Cup
:white_check_mark: Be a member of a GraphAcademy Cup country team
:white_check_mark: Include their GraphAcademy Cup Team URL in their submission
:white_check_mark: Include their GraphAcademy Public Profile Username in their submission
:white_check_mark: Have a public GraphAcademy profile that can be verified
:cross_mark: Projects may only be submitted once during the GraphAcademy Cup
:cross_mark: Previous GraphAcademy Cup submissions and qualified Aura Agent Hackathon submissions are not eligible for resubmission
:cross_mark: Anonymous GraphAcademy profiles may participate but are not eligible for weekly LEGO prizes or winner selection
:information_source: Neo4j may verify participant eligibility before awarding prizes

Good luck, have fun, and happy graph building! :rocket:

Week 2: Airline Baggage Handling Graph - Germany

GraphAcademy Cup Team Profile Link

Paste the URL to your country team page: Germany | GraphAcademy Cup

Team Profile Link:


GraphAcademy Public Profile Username

Public Profile Username:Rishabh Prasad

:warning: Anonymous GraphAcademy profiles are not eligible for weekly LEGO prizes.


Country

Country: Germany


GraphAcademy Course Completed

Course Name: Neo4j Fundamentals, Cypher Fundamentals


Project Name

Project Name: Airline Baggage Handling Graph


Description

Tell us what you built.

Description: A small Neo4j graph that models how a checked bag travels through an airline
network and shows where bags get mishandled. It connects passengers, bags,
flights, and airports so that simple Cypher queries can trace a bag's route,
reveal when it misses a connecting flight at a hub, and identify which
destination it failed to reach. It also ranks the busiest transfer hubs and the
flights carrying the most bags to highlight the most critical points in baggage
operations. Built entirely with beginner Cypher - pattern matching, filtering,
sorting, and counting - it shows how thinking in relationships makes baggage
tracking in airline operations clear and intuitive.


What Did You Learn?

What concepts, techniques, or lessons from GraphAcademy did you apply?

What I Learned: The most valuable thing I learned in Cypher Fundamentals was pattern matching with MATCH — describing connections directly, for example (Bag)-[:LOADED_ON]->(Flight). Once that clicked, answering questions felt like simply following the lines from one node to the next, instead of writing complicated joins.

I applied this by building an Airline Baggage Handling Graph. A checked bag must be loaded onto every flight in a passenger's itinerary, so when one flight connects to another but the bag isn't on that next leg, the bag is mishandled. Using basic MATCH patterns I could trace a bag's journey across a connection, and with a simple WHERE filter I could show exactly which destination a mishandled bag failed to reach. With count() and ORDER BY I found the busiest
transfer hub — the most critical point to monitor.

In a real airline, this approach would let a baggage team instantly see where
bags are at risk and why, using clear, readable graph queries.


Screenshot


Repository / Demo Link

GitHub / Demo URL (Optional): GitHub - rishabhprsd7/airline-baggage-tracking-neo4j-w2 · GitHub