def jens_transformation_alpha(graph: BELGraph) -> DiGraph:
result = DiGraph()<EOL>for u, v, d in graph.edges(data=True):<EOL><INDENT>relation = d[RELATION]<EOL>if relation == POSITIVE_CORRELATION:<EOL><INDENT>result.add_edge(u, v)<EOL>result.add_edge(v, u)<EOL><DEDENT>elif relation in CAUSAL_INCREASE_RELATIONS:<EOL><INDENT>result.add_edge(u, v)<EOL><DEDENT>elif relation in CAUSAL_DECREASE_RELATIONS:<EOL><INDENT>result.add_edge(v, u)<EOL><DEDENT><DEDENT>return result<EOL>
Apply Jens' transformation (Type 1) to the graph.

    1. Induce a sub-graph over causal + correlative edges
    2. Transform edges by the following rules:
        - increases => increases
        - decreases => backwards increases
        - positive correlation => two way increases
        - negative correlation => delete

    The resulting graph can be used to search for 3-cycles, which now symbolize unstable triplets where ``A -> B``,
    ``A -| C`` and ``B positiveCorrelation C``.