import networkx as nx
import util

def neighborrank(graph, n=100, neighborhood_depth=2):
    """Compute the NeighborRank of the top n nodes in graph, using the
    specified neighborhood_depth."""
    # Get top n nodes with highest indegree (most often cited).
    nodes = util.top_n_from_dict(graph.in_degree(), n=n)

    # Find neighborhood sizes.
    nhood_sizes = {}
    for root in nodes:
        # Neighborhood begins with just the root.
        nhood = set([root])
        # Expand the neighborhood repeatedly until the depth is reached.
        for i in range(neighborhood_depth):
            prev_nhood = nhood.copy()
            for node in prev_nhood:
                nhood |= set(graph.successors(node))
        # Update the results dict.
        nhood_sizes[root] = len(nhood)

    return nhood_sizes

import networkx as nx
import util

def neighborrank(graph, n=100, neighborhood_depth=2):
    """Compute the NeighborRank of the top n nodes in graph, using the
    specified neighborhood_depth."""
    # Get top n nodes with highest outdegree (most often cited).
    nodes = util.top_n_from_dict(graph.out_degree(), n=n)

    # Find neighborhood sizes.
    nhood_sizes = {}
    for root in nodes:
        # Neighborhood begins with just the root.
        nhood = set([root])
        # Expand the neighborhood repeatedly until the depth is reached.
        for i in range(neighborhood_depth):
            prev_nhood = nhood.copy()
            for node in prev_nhood:
                nhood |= set(graph.predecessors(node))
        # Update the results dict.
        nhood_sizes[root] = len(nhood)

    return nhood_sizes

Switch in/out degree for neighbor rank
Switch in/out degree for neighbor rank

Edges point in the direction of time, or influence. That means we're
concerned with outdegree (amount of nodes influenced by the current
node), not indegree (amount of nodes that influence the current node).

  import networkx as nx
  import util
  
  def neighborrank(graph, n=100, neighborhood_depth=2):
      """Compute the NeighborRank of the top n nodes in graph, using the
      specified neighborhood_depth."""
-     # Get top n nodes with highest indegree (most often cited).
+     # Get top n nodes with highest outdegree (most often cited).
-     nodes = util.top_n_from_dict(graph.in_degree(), n=n)
+     nodes = util.top_n_from_dict(graph.out_degree(), n=n)
  
      # Find neighborhood sizes.
      nhood_sizes = {}
      for root in nodes:
          # Neighborhood begins with just the root.
          nhood = set([root])
          # Expand the neighborhood repeatedly until the depth is reached.
          for i in range(neighborhood_depth):
              prev_nhood = nhood.copy()
              for node in prev_nhood:
-                 nhood |= set(graph.successors(node))
+                 nhood |= set(graph.predecessors(node))
          # Update the results dict.
          nhood_sizes[root] = len(nhood)
  
      return nhood_sizes
  
Switch in/out degree for neighbor rank
## Code Before:
import networkx as nx
import util

def neighborrank(graph, n=100, neighborhood_depth=2):
    """Compute the NeighborRank of the top n nodes in graph, using the
    specified neighborhood_depth."""
    # Get top n nodes with highest indegree (most often cited).
    nodes = util.top_n_from_dict(graph.in_degree(), n=n)

    # Find neighborhood sizes.
    nhood_sizes = {}
    for root in nodes:
        # Neighborhood begins with just the root.
        nhood = set([root])
        # Expand the neighborhood repeatedly until the depth is reached.
        for i in range(neighborhood_depth):
            prev_nhood = nhood.copy()
            for node in prev_nhood:
                nhood |= set(graph.successors(node))
        # Update the results dict.
        nhood_sizes[root] = len(nhood)

    return nhood_sizes

## Instruction:
Switch in/out degree for neighbor rank
## Code After:
import networkx as nx
import util

def neighborrank(graph, n=100, neighborhood_depth=2):
    """Compute the NeighborRank of the top n nodes in graph, using the
    specified neighborhood_depth."""
    # Get top n nodes with highest outdegree (most often cited).
    nodes = util.top_n_from_dict(graph.out_degree(), n=n)

    # Find neighborhood sizes.
    nhood_sizes = {}
    for root in nodes:
        # Neighborhood begins with just the root.
        nhood = set([root])
        # Expand the neighborhood repeatedly until the depth is reached.
        for i in range(neighborhood_depth):
            prev_nhood = nhood.copy()
            for node in prev_nhood:
                nhood |= set(graph.predecessors(node))
        # Update the results dict.
        nhood_sizes[root] = len(nhood)

    return nhood_sizes
