42     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_adjacency_directed()  local
45     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_adjacency_directed()
46         for (j = 0; j < no_of_nodes; j++) {  in igraph_i_adjacency_directed()
60     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_adjacency_max()  local
63     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_adjacency_max()
64         for (j = i; j < no_of_nodes; j++) {  in igraph_i_adjacency_max()
82     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_adjacency_upper()  local
85     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_adjacency_upper()
86         for (j = i; j < no_of_nodes; j++) {  in igraph_i_adjacency_upper()
99     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_adjacency_lower()  local
102     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_adjacency_lower()
116     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_adjacency_min()  local
119     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_adjacency_min()
120         for (j = i; j < no_of_nodes; j++) {  in igraph_i_adjacency_min()
199     long int no_of_nodes;  in igraph_adjacency()  local
209     no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_adjacency()
231     IGRAPH_CHECK(igraph_create(graph, &edges, (igraph_integer_t) no_of_nodes,  in igraph_adjacency()
276     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_weighted_adjacency_directed()  local
279     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_weighted_adjacency_directed()
280         for (j = 0; j < no_of_nodes; j++) {  in igraph_i_weighted_adjacency_directed()
303     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_weighted_adjacency_plus()  local
306     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_weighted_adjacency_plus()
307         for (j = i; j < no_of_nodes; j++) {  in igraph_i_weighted_adjacency_plus()
333     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_weighted_adjacency_max()  local
336     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_weighted_adjacency_max()
337         for (j = i; j < no_of_nodes; j++) {  in igraph_i_weighted_adjacency_max()
363     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_weighted_adjacency_upper()  local
366     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_weighted_adjacency_upper()
367         for (j = i; j < no_of_nodes; j++) {  in igraph_i_weighted_adjacency_upper()
389     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_weighted_adjacency_lower()  local
392     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_weighted_adjacency_lower()
415     long int no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_i_weighted_adjacency_min()  local
418     for (i = 0; i < no_of_nodes; i++) {  in igraph_i_weighted_adjacency_min()
419         for (j = i; j < no_of_nodes; j++) {  in igraph_i_weighted_adjacency_min()
514     long int no_of_nodes;  in igraph_weighted_adjacency()  local
526     no_of_nodes = igraph_matrix_nrow(adjmatrix);  in igraph_weighted_adjacency()
561     IGRAPH_CHECK(igraph_empty(graph, (igraph_integer_t) no_of_nodes,  in igraph_weighted_adjacency()
612     long int no_of_nodes = igraph_adjlist_size(adjlist);  in igraph_adjlist()  local
621     for (i = 0; i < no_of_nodes; i++) {  in igraph_adjlist()
631     for (i = 0; i < no_of_nodes; i++) {  in igraph_adjlist()
672                                    (igraph_integer_t) no_of_nodes, 0));  in igraph_adjlist()
675                                    (igraph_integer_t) no_of_nodes, 1));  in igraph_adjlist()