Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- void main()
- {
- int number_of_nodes = 7, i, j;
- int graph[50][50] =
- {
- {0, 1, 1, 0, 0, 0, 1},
- {0, 0, 0, 1, 0, 0, 0},
- {0, 0, 0, 0, 1, 1, 0},
- {0, 0, 1, 0, 0, 0, 0},
- {0, 0, 0, 1, 0, 1, 0},
- {0, 0, 0, 0, 0, 0, 0},
- {0, 1, 0, 0, 0, 0, 0}
- };
- int indegree = 0;
- int outdegree = 0;
- for( i=0; i < number_of_nodes; i++ ){
- for( j = 0; j < number_of_nodes; j++ ){
- if( graph[j][i] == 1 )
- indegree++;
- }
- printf("In Degree: %d ", indegree);
- indegree = 0;
- for( j = 0; j < number_of_nodes; j++ ){
- if( graph[i][j] == 1 )
- outdegree++;
- }
- printf("Out Degree: %d\n", outdegree);
- outdegree = 0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement