Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- struct node {
- int od;
- int val;
- node* next;
- };
- void Add(node*& H, int x, int y) {
- node* temp = new node;
- temp->val = x;
- temp->od = y;
- temp->next = H;
- H = temp;
- }
- void show(node* H) {
- node* temp = H;
- while (temp != NULL) {
- cout << temp->val << "/" << temp->od << "->";
- temp = temp->next;
- }
- cout << "NULL" << endl;
- }
- int main() {
- fstream graf;
- graf.open("graf.txt");
- int size;
- graf >> size;
- node** LS = new node * [size];
- for (int i = 0; i < size; i++)
- LS[i] = NULL;
- for (int i = 0; i < size; i++)
- for (int j = 0; j < size; j++) {
- int distance;
- graf >> distance;
- if (distance != 0)
- Add(LS[i], j, distance);
- }
- for (int i = 0; i < size; i++) {
- cout << "LS[" << i << "]" << "->";
- show(LS[i]);
- cout << endl;
- }
- system("PAUSE");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement