Hi: What algoritm does geng use to produce only those graphs which are not isomorphic to each other? Also is geng considering directed graphs when it refers to cycle free graphs? Could you please give me a brief description and/or a reference for more detail? thanks, Wahid.