GRNODEINNERDEGREE Inner degree of a node in a graph.

   DEG = grNodeInnerDegree(NODE, EDGES);
   Returns the inner degree of a node in the given edge list, i.e. the
   number of edges arriving to it.
   NODE is the index of the node, and EDGES is a liste of couples of
   indices (origin and destination node).   
 
   Note: Also works when node is a vector of indices

   See Also:
   grNodeDegree, grNodeOuterDegree


 ------
 Author: David Legland
 e-mail: david.legland@grignon.inra.fr
 Created: 2006-01-17
 Copyright 2006 INRA - CEPIA Nantes - MIAJ (Jouy-en-Josas).

Package: matgeom