  A new approach to find all the transitive orientations for a comparability
graph (finite or infinite) is presented. This approach is based on the link
between the notion of ``strong'' partitive set and the forcing theory (notions
of simplices and multiplices). A mathematical algorithm is given for the case
of a comparability graph which has only non limit sub-graphs.
