▁transport ▁a ▁finite ▁number ▁of ▁struct ured ▁Items . ▁ ▁D ry ad ▁defines ▁a ▁domain - specific ▁language , ▁which ▁is ▁implemented ▁via ▁a ▁C ++ ▁library , ▁that ▁is ▁used ▁to ▁create ▁and ▁model ▁a ▁D ry ad ▁execution ▁graph . ▁Comput ational ▁vertices ▁are ▁written ▁using ▁standard ▁C ++ ▁construct s . ▁To ▁make ▁them ▁accessible ▁to ▁the ▁D ry ad ▁runtime , ▁they ▁must ▁be ▁enc aps ulated ▁in ▁a ▁class ▁that ▁inher its ▁from ▁the ▁Graph Node ▁base ▁class . ▁The ▁graph ▁is ▁defined ▁by ▁adding ▁edges ; ▁edges ▁are ▁added ▁by ▁using ▁a ▁composition ▁operator ▁( defined ▁by ▁D ry ad ) ▁that ▁connect s ▁two ▁graphs ▁( or ▁two ▁nodes ▁of ▁a ▁graph ) ▁with ▁an ▁edge . ▁Man aged ▁code ▁wra ppers ▁for ▁the ▁D ry ad ▁API ▁can ▁also ▁be ▁written . ▁ ▁There ▁exist ▁several ▁high - level ▁language ▁comp ilers ▁which ▁use ▁D ry ad ▁as ▁a ▁runtime ; ▁examples ▁include ▁S cope ▁( Struct ured ▁Comput ations ▁Opt im ized ▁for ▁Par allel ▁Exec ution ) ▁and ▁D ry ad LIN Q . ▁ ▁In ▁October ▁ 2 0 1 1 , ▁Microsoft ▁dis cont in ued ▁active ▁development ▁on ▁D ry ad , ▁sh ifting ▁focus ▁to ▁the ▁Apache ▁H adoop ▁framework . ▁ ▁References ▁ ▁Further ▁reading ▁ ▁External ▁links ▁D ry ad : ▁Program ming ▁the ▁Data ▁Center ▁D ry ad ▁Home ▁ ▁Video ▁of ▁Michael ▁Is ard ▁explaining ▁D ry ad ▁at ▁Google ▁ ▁Category : Con