Reception Garland
Lighter and more photogenic than the muhurtham pair, built for a long evening under stage lights.
Where to buy
Every shop that carries it, cheapest in-stock first.
Price, stock and lead time are properties of the AVAILABLE_AT relationship — the same product costs different amounts at different shops, and that fact belongs to the pairing.Product → AVAILABLE_AT → Florist → LOCATED_IN → Location
| Shop | Area | Rating | Price | Availability |
|---|---|---|---|---|
| Sri Kamakshi Flower Stall | T. Nagar | 4.7(412) | ₹1,376 | In stock · Same day |
| Kapali Flower Mart | Mylapore | 4.3(201) | ₹1,408 | In stock · Same day |
| Madurai Mala Kadai | Meenakshi Nagar | 4.6(288) | ₹1,440 | In stock · Same day |
| Dadar Phool Galli | Dadar | 4.7(891) | ₹1,440 | In stock · Same day |
| Mylapore Mala Stores | Mylapore | 4.8(638) | ₹1,472 | In stock · Same day |
| Indiranagar Blooms | Indiranagar | 4.2(143) | ₹1,568 | In stock · Same day |
| Dadar Mala Corner | Dadar | 4.3(224) | ₹1,632 | In stock · Same day |
| Kothrud Phool Ghar | Kothrud | 4.4(176) | ₹1,728 | Out of stock |
7 of 8 shops have it in stock right now.
If you can't get it
Alternatives found by walking the substitution chain up to three hops.
Closeness is multiplied along the chain, so a substitute reached in two hops automatically scores lower than a direct one — no rule had to say so.Product → SUBSTITUTE_FOR*1..3 → Product
Heavier than ideal for an evening, but the same construction.
Needed for
Every occasion that calls for this, and how much each one needs.
Exactly the same relationship as the checklist, traversed in the other direction and at the same cost. A relational schema would need a second index for this.Occasion → NEEDS → Product (read backwards)
- Wedding (Kalyanam)Recommended1 pair
Lighter than the muhurtham pair, for a long evening under lights.
How Reception Garland connects to Wedding (Kalyanam)
The route the graph took, not just the fact that a route exists.
This is the query with no relational equivalent. A join returns rows; the joins that connected them are gone by the time the result exists. Only a graph can hand back the path itself.shortestPath, up to 6 hops
- Reception Garland is needed by
- Wedding (Kalyanam)
1 hop through the graph