Skip to content
POOJYO
FlowersWhiteConsumable

Nandiyavattai

Crepe jasmine. A staple archana flower for Shiva, offered by the handful.

₹5per piece

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

Shops selling Nandiyavattai
ShopAreaRatingPriceAvailability
Jayanagar Hoovina AngadiJayanagar 4.7(466)₹5In stock · Next day
Meenakshi Flower HouseMeenakshi Nagar 4.9(754)₹5In stock · Next day
Sri Kamakshi Flower StallT. Nagar 4.7(412)₹5In stock · Next day
Matunga Pooja BhandarMatunga 4.6(402)₹5In stock · Next day
Dadar Mala CornerDadar 4.3(224)₹6In stock · Next day
Kovai Poo NilayamR. S. Puram 4.6(324)₹6In stock · 2 days
Mysuru Hoo MandiDevaraja Mohalla 4.6(267)₹6In stock · Next day
Kothrud Phool GharKothrud 4.4(176)₹4Out 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

There is no accepted substitute for Nandiyavattai.

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)

How Nandiyavattai connects to Saraswati Pooja

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

  1. Nandiyavattai is needed by
  2. Saraswati Pooja

1 hop through the graph