GetKCoreNodes (SWIG)
''''''''''''''''''''

.. function:: GetKCoreNodes(Graph, CoreIdSzV)
   :noindex:

Returns the number of nodes in each core of order K (where K=0, 1, ...). Stores pairs (K, number of nodes) in *CoreIdSzV*.

Parameters:

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

- *CoreIdSzV*: :class:`TIntPrV`, a vector of (int, int) pairs (output)
    A vector of (order, number of nodes of the given order) pairs. 

Return value:

- int
    The number of cores.


The following example shows how to get the number of nodes for a given k-core in
:class:`TNGraph`, :class:`TUNGraph`, and :class:`TNEANet`::

    import snap

    Graph = snap.GenRndGnm(snap.PNGraph, 100, 1000)
    CoreIDSzV = snap.TIntPrV()
    kValue = snap.GetKCoreNodes(Graph, CoreIDSzV)
    for item in CoreIDSzV:
        print("order: %d nodes: %d" % (item.GetVal1(), item.GetVal2()))

    UGraph = snap.GenRndGnm(snap.PUNGraph, 100, 1000)
    CoreIDSzV = snap.TIntPrV()
    kValue = snap.GetKCoreNodes(UGraph, CoreIDSzV)
    for item in CoreIDSzV:
        print("order: %d nodes: %d" % (item.GetVal1(), item.GetVal2()))

    Network = snap.GenRndGnm(snap.PNEANet, 100, 1000)
    CoreIDSzV = snap.TIntPrV()
    kValue = snap.GetKCoreNodes(Network, CoreIDSzV)
    for item in CoreIDSzV:
        print("order: %d nodes: %d" % (item.GetVal1(), item.GetVal2()))