Advertisement
Guest User

Untitled

a guest
Feb 22nd, 2017
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.30 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #include <conio.h>
  4. #include <iomanip>
  5.  
  6. using namespace std;
  7.  
  8. int** input();
  9. void sm( int , int , int** );
  10. void inc( int , int , int** );
  11.  
  12. int main()
  13. {
  14. int n,m;
  15. int **A;
  16. A=input();
  17. n=A[0][0];
  18. m=A[0][1];
  19. sm(n,m,A);
  20. inc(n,m,A);
  21. getch();
  22. return 0;
  23.  
  24. }
  25.  
  26. int** input()
  27. {
  28. int temp1,temp2;
  29. ifstream fin("test.txt");
  30. fin >> temp1 >> temp2;
  31. int **p= new int*[temp2];
  32.  
  33. for(int i(0);i<=temp2;i++)
  34. {
  35. p[i]=new int[2];
  36. }
  37.  
  38. p[0][0] = temp1;
  39. p[0][1] = temp2;
  40.  
  41. for(int i(1);i<=temp2;i++)
  42. {
  43. fin >> p[i][0] >> p[i][1];
  44. }
  45. return p;
  46. }
  47.  
  48. void sm( int n, int m, int** a )
  49. {
  50. int **M = new int*[n];
  51. for(int i(0);i<n;i++)
  52. {
  53. M[i]=new int[n];
  54. }
  55.  
  56. for(int i(0);i<n;i++)
  57. {
  58. for (int j(0);j<n;j++)
  59. {
  60. M[i][j]=0;
  61. }
  62. }
  63.  
  64. for(int i(1);i<=m;i++)
  65. {
  66. int t1,t2;
  67. t1 = a[i][0]-1;
  68. t2 = a[i][1]-1;
  69. M[t1][t2]++;
  70. }
  71. //=====================================
  72. cout << "Matrica smezhnosti:\n\n";
  73. cout << " ";
  74. for (int i(1);i<=n;i++)
  75. {
  76. cout <<setw(4)<<i<<" ";
  77.  
  78. }
  79. cout << endl << endl;
  80. //====================================
  81. for(int i(0);i<n;i++)
  82. {
  83. cout <<"\t\t " << i+1 << " ";
  84. for (int j(0);j<n;j++)
  85. {
  86. cout <<setw(4)<<M[i][j]<<" ";
  87. }
  88. cout << endl ;
  89. }
  90. //=============================
  91. for(int i(0);i<n;i++)
  92. {
  93. delete[]M[i];
  94. }
  95. delete []M;
  96. }
  97.  
  98. void inc( int n, int m, int** a )
  99. {
  100. int **Mx = new int*[n];
  101. for(int i(0);i<n;i++)
  102. {
  103. Mx[i] = new int[m];
  104. }
  105.  
  106. for(int i(0);i<n;i++)
  107. {
  108. for (int j(0);j<m;j++)
  109. {
  110. Mx[i][j]=0;
  111. }
  112. }
  113.  
  114. for(int j(1);j<=m;j++)
  115. {
  116. int t1,t2;
  117. t1 = a[j][0]-1;
  118. t2 = a[j][1]-1;
  119. if(t1==t2)
  120. {
  121. Mx[t1][j-1] = 2;
  122. }else
  123. {
  124. Mx[t2][j-1] = 1;
  125. Mx[t1][j-1] = -1;
  126. }
  127. }
  128. //=====================================
  129. cout << "\nMatrica incidentnosti:\n\n";
  130. cout << " ";
  131. for (int i(1);i<=m;i++)
  132. {
  133. cout <<setw(4)<<i<<" ";
  134.  
  135. }
  136.  
  137. cout << endl << endl;
  138. //====================================
  139. for(int i(0);i<n;i++)
  140. {
  141. cout <<"\t\t " << i+1 << " ";
  142. for (int j(0);j<m;j++)
  143. {
  144. cout <<setw(4)<<Mx[i][j]<<" ";
  145. }
  146. cout << endl ;
  147. }
  148. //===========================
  149.  
  150. for(int i(0);i<n;i++)
  151. {
  152. delete []Mx[i] ;
  153. }
  154. delete []Mx;
  155. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement