Arali (Oleander)
Hardy and abundant. Offered for Shiva and Murugan; never eaten, as the plant is toxic.
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 |
|---|---|---|---|---|
| Kothrud Phool Ghar | Kothrud | 4.4(176) | ₹5 | In stock · Next day |
| Jayanagar Hoovina Angadi | Jayanagar | 4.7(466) | ₹6 | In stock · 2 days |
| Meenakshi Flower House | Meenakshi Nagar | 4.9(754) | ₹6 | In stock · Next day |
| Sri Kamakshi Flower Stall | T. Nagar | 4.7(412) | ₹6 | In stock · Next day |
| Dadar Mala Corner | Dadar | 4.3(224) | ₹7 | In stock · 2 days |
| Kovai Poo Nilayam | R. S. Puram | 4.6(324) | ₹7 | In stock · Next day |
| Mysuru Hoo Mandi | Devaraja Mohalla | 4.6(267) | ₹7 | In stock · Next day |
7 of 7 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
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)
- OnamEssential60 pieces
Petals are separated by colour the night before.
- Maha ShivaratriRecommended20 pieces
How Arali (Oleander) connects to Onam
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
- Arali (Oleander) is needed by
- Onam
1 hop through the graph