GetMxWcc
''''''''

.. function:: GetMxWcc()

A graph method that returns a graph representing the largest weakly connected component in the original graph.

Parameters:

- None

Return value:

- graph
	A graph representing the largest weakly connected component in the original graph.


The following example shows how to get the largest weakly connected component in
:class:`TNGraph`, :class:`TUNGraph`, and :class:`TNEANet`::

    import snap

    Graph = snap.GenRndGnm(snap.TNGraph, 100, 500)
    MxWcc = Graph.GetMxWcc()
    for EI in MxWcc.Edges():
        print("edge: (%d, %d)" % (EI.GetSrcNId(), EI.GetDstNId()))

    UGraph = snap.GenRndGnm(snap.TUNGraph, 100, 500)
    MxWcc = UGraph.GetMxWcc()
    for EI in MxWcc.Edges():
        print("edge: (%d, %d)" % (EI.GetSrcNId(), EI.GetDstNId()))

    Network = snap.GenRndGnm(snap.TNEANet, 100, 500)
    MxWcc = Network.GetMxWcc()
    for EI in MxWcc.Edges():
        print("edge: (%d, %d)" % (EI.GetSrcNId(), EI.GetDstNId()))