CntUniqBiDirEdges (SWIG)
''''''''''''''''''''''''

.. function:: CntUniqBiDirEdges(Graph)
   :noindex:

Returns the number of unique bidirectional edges in the graph *Graph*.

Parameters:

- *Graph*: graph (input)
    A Snap.py graph or a network.

Return value:

- int
    The number of unique bidirectional edges in *Graph*.


The following example shows how to calculate the number of unique bidirectional edges in
:class:`TNGraph`, :class:`TUNGraph`, and :class:`TNEANet`::

    import snap

    Graph = snap.GenRndGnm(snap.PNGraph, 100, 1000)
    Count = snap.CntUniqBiDirEdges(Graph)
    print("Directed Graph: Count of unique bidirectional edges is %d" % Count)

    UGraph = snap.GenRndGnm(snap.PUNGraph, 100, 1000)
    Count = snap.CntUniqBiDirEdges(UGraph)
    print("Undirected Graph: Count of unique bidirectional edges is %d" % Count)

    Network = snap.GenRndGnm(snap.PNEANet, 100, 1000)
    Count = snap.CntUniqBiDirEdges(Network)
    print("Network Graph: Count of unique bidirectional edges is %d" % Count)