GraphAcademy Cup Submission
Topic Title Format:
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
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
Additional Notes
Anything else you'd like the community to know?
Additional Notes:
Submission Checklist
Before submitting, confirm that:
-
I am participating in the GraphAcademy Cup.
-
I included my Team Profile Link.
-
I included my GraphAcademy Public Profile Username.
-
My profile is public and eligible for prize verification.
-
My project is related to concepts learned in GraphAcademy.
Contest Reminder
One LEGO prize winner will be selected every week during the GraphAcademy Cup.
Terms & Conditions:
FAQ: