Bananas
Offered whole and distributed as prasad. Small yellow varieties are preferred.
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 |
|---|---|---|---|---|
| Malleshwaram Pooja Samagri | Malleshwaram | 4.5(312) | ₹63 | In stock · Next day |
| Adyar Pooja Mart | Adyar | 4.5(289) | ₹70 | In stock · Next day |
| Matunga Pooja Bhandar | Matunga | 4.6(402) | ₹69 | Out of stock |
2 of 3 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
There is no accepted substitute for Bananas.
For items like tulsi, durva grass and bilva leaves this is a real answer, not a gap in the data — the ritual does not permit a stand-in. The graph represents that by the honest means of having no relationship.
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)
- NavratriEssential3 dozen
- Lakshmi PoojaEssential1 dozen
- PongalEssential2 dozen
- Krishna JanmashtamiEssential1 dozen
- Saraswati PoojaEssential1 dozen
- Varalakshmi VrathamEssential2 dozen
- Seemantham (Baby Shower)Essential2 dozen
- Maha ShivaratriRecommended1 dozen
- UgadiRecommended1 dozen
- Karthigai DeepamRecommended1 dozen
- New Vehicle PoojaRecommended1 dozen
How Bananas connects to Navratri
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
- Bananas is needed by
- Navratri
1 hop through the graph