Diffie Hellman g Finding

For the discrete logarithm $Y=g^x\mathrm{mod}p$ The possible values of $g$ include all prime numbers < p that result in $g^x\mathrm{mod}p$ being cyclic. You can find all g values on this site: https://asecuritysite.com/elgamal/pickg Commonly, Diffie Hellman exchanges use the smallest possible g value.