vpr/src/tileable_rr_graph/rr_graph_builder_utils.cpp
short find_rr_graph_max_fan_in(const RRGraph& rr_graph,
                               const std::vector<t_rr_type>& node_types) {
  short max_fan_in = 0;

  for (const RRNodeId& node : rr_graph.nodes()) {
    /* Bypass the nodes not in the class */
    if (node_types.end() == std::find(node_types.begin(), node_types.end(), rr_graph.node_type(node))) {
      continue;
    }
    max_fan_in = std::max(rr_graph.node_fan_in(node), max_fan_in); 
  } 

  return max_fan_in;
}
/************************************************************************
 * Find the maximum fan-in for a given class of nodes
 * in a routing resource graph
 ************************************************************************/
Find the maximum fan-in for a given class of nodes
in a routing resource graph
Find the maximum fan - in for a given class of nodes in a routing resource graph
short find_rr_graph_max_fan_in(const RRGraph& rr_graph,
                               const std::vector<t_rr_type>& node_types) {
  short max_fan_in = 0;
  for (const RRNodeId& node : rr_graph.nodes()) {
    if (node_types.end() == std::find(node_types.begin(), node_types.end(), rr_graph.node_type(node))) {
      continue;
    }
    max_fan_in = std::max(rr_graph.node_fan_in(node), max_fan_in); 
  } 
  return max_fan_in;
}
short find_rr_graph_max_fan_in ( const RRGraph & rr_graph , const std :: vector < t_rr_type > & node_types ) { short max_fan_in = 0 ; for ( const RRNodeId & node : rr_graph . nodes ( ) ) { if ( node_types . end ( ) == std :: find ( node_types . begin ( ) , node_types . end ( ) , rr_graph . node_type ( node ) ) ) { continue ; } max_fan_in = std :: max ( rr_graph . node_fan_in ( node ) , max_fan_in ) ; } return max_fan_in ; }
Find the maximum fan-in for a given class of nodes
 in a routing resource graph
Find the maximum fan - in for a given class of nodes in a routing resource graph
/* Bypass the nodes not in the class */