Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Data Structures and Algorithms: Stack and Graph Implementation, Cheat Sheet of Computer Science

Arab Academy for Science & TechnologyComputer Science

The implementation of a stack data structure using c++ and a graph data structure using a class in c++. The stack implementation includes push, pop, isempty, and display functions, while the graph implementation includes a constructor, destructor, isconnected, addedge, and dfs functions. The main function demonstrates the use of the stack and graph data structures by creating a graph with 8 vertices and adding edges between them, then performing a depth-first search starting from vertex 1 to find vertex 4.

Typology: Cheat Sheet

2022/2023

Available from 06/05/2024

omr-22
omr-22 🇪🇬

12 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
#include "stdafx.h"
#include <iostream>
#include <ctime>
#include <malloc.h>
using namespace std;
struct node{
int info;
struct node *next;
};
class stack{
struct node *top;
public:
stack();
void push(int);
int pop();
bool isEmpty();
void display();
};
stack::stack(){
top = NULL;
}
void stack::push(int data){
node *p;
if ((p = (node*)malloc(sizeof(node))) == NULL){
cout << "Memory Exhausted";
exit(0);
}
pf3
pf4
pf5

Partial preview of the text

Download Data Structures and Algorithms: Stack and Graph Implementation and more Cheat Sheet Computer Science in PDF only on Docsity!

#include "stdafx.h" #include #include #include <malloc.h> using namespace std; struct node{ int info; struct node *next; }; class stack{ struct node *top; public: stack(); void push(int); int pop(); bool isEmpty(); void display(); }; stack::stack(){ top = NULL; } void stack::push(int data){ node p; if ((p = (node)malloc(sizeof(node))) == NULL){ cout << "Memory Exhausted"; exit(0); }

p = new node; p->info = data; p->next = NULL; if (top != NULL){ p->next = top; } top = p; } int stack::pop(){ struct node *temp; int value; if (top == NULL){ cout << "\nThe stack is Empty" << endl; } else{ temp = top; top = top->next; value = temp->info; delete temp; } return value; } bool stack::isEmpty(){ return (top == NULL); } void stack::display(){ struct node *p = top;

A[i] = new int[n]; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) A[i][j] = 0; } Graph::~Graph() { for (int i = 0; i < n; ++i) delete[] A[i]; delete[] A; } bool Graph::isConnected(int x, int y) { return (A[x - 1][y - 1] == 1); } void Graph::addEdge(int x, int y) { A[x - 1][y - 1] = A[y - 1][x - 1] = 1; } void Graph::DFS(int x, int required){ stack s; bool *visited = new bool[n + 1]; int i; for (i = 0; i <= n; i++) visited[i] = false; s.push(x); visited[x] = true; if (x == required) return; cout << "Depth first Search starting from vertex ";

cout << x << " : " << endl; while (!s.isEmpty()){ int k = s.pop(); if (k == required) break; cout << k << " "; for (i = n; i >= 0; --i) if (isConnected(k, i) && !visited[i]) { s.push(i); visited[i] = true; } } cout << endl; delete[] visited; } int main(){ Graph g(8); g.addEdge(1, 2); g.addEdge(1, 3); g.addEdge(1, 4); g.addEdge(2, 5); g.addEdge(2, 6); g.addEdge(4, 7); g.addEdge(4, 8); g.DFS(1, 4); return 0; }