Advertisement
Guest User

Untitled

a guest
Jan 18th, 2020
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5.  
  6. struct node {
  7. int od;
  8. int val;
  9. node* next;
  10. };
  11.  
  12.  
  13. void Add(node*& H, int x, int y) {
  14. node* temp = new node;
  15. temp->val = x;
  16. temp->od = y;
  17. temp->next = H;
  18. H = temp;
  19. }
  20.  
  21. void show(node* H) {
  22. node* temp = H;
  23. while (temp != NULL) {
  24. cout << temp->val << "/" << temp->od << "->";
  25. temp = temp->next;
  26. }
  27. cout << "NULL" << endl;
  28. }
  29.  
  30. int main() {
  31. fstream graf;
  32. graf.open("graf.txt");
  33. int size;
  34. graf >> size;
  35.  
  36. node** LS = new node * [size];
  37. for (int i = 0; i < size; i++)
  38. LS[i] = NULL;
  39. for (int i = 0; i < size; i++)
  40. for (int j = 0; j < size; j++) {
  41. int distance;
  42. graf >> distance;
  43. if (distance != 0)
  44. Add(LS[i], j, distance);
  45. }
  46.  
  47. for (int i = 0; i < size; i++) {
  48. cout << "LS[" << i << "]" << "->";
  49. show(LS[i]);
  50. cout << endl;
  51. }
  52.  
  53. system("PAUSE");
  54. return 0;
  55.  
  56. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement