Ce diaporama a bien été signalé.
Le téléchargement de votre SlideShare est en cours. ×

# Techniques for graph

Publicité
Publicité
Publicité
Publicité
Publicité
Publicité
Publicité
Publicité
Publicité
Publicité
Publicité
Prochain SlideShare
Graph Theory
Chargement dans…3
×

## Consultez-les par la suite

1 sur 9 Publicité

# Techniques for graph

Data structure analytics

Data structure analytics

Publicité
Publicité

## Plus De Contenu Connexe

Publicité

### Techniques for graph

1. 1. DATA STRUCTURE ANALYTICS I. M. Sc computer science S. Sowndarya NADAR SARASWATHI COLLEGE OF ARTS AND SCIENCE
2. 2. A Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any two nodes in the graph. More formally a Graph is composed of a set of vertices( V ) and a set of edges( E ). The graph is denoted by G(E, V).
3. 3. COMPONENTS OF A GRAPH Vertices are the fundamental units of the graph. Sometimes, vertices are also known as vertex or nodes. Every node/vertex can be labeled or unlabelled. VERTICES:
4. 4. COMPONENTS OF A GRAPH Edges are drawn or used to connect two nodes of the graph. It can be ordered pair of nodes in a directed graph. Edges can connect any two nodes in any possible way. There are no rules. Sometimes, edges are also known as arcs. Every edge can be labeled/unlabelled. EDGES:
5. 5. • Introduction to Graphs • Graph and its representations • Types of Graphs with Examples • Basic Properties of a Graph • Applications, Advantages and Disadvantages of Graph • Difference between graph and tree BASICS OF GRAPH
6. 6. BREADTH FIRST TRAVERSAL FOR A GRAPH DEPTH FIRST TRAVERSAL FOR A GRAPH APPLICATIONS OF DEPTH FIRST SEARCH APPLICATIONS OF BREADTH FIRST TRAVERSAL GRAPH REPRESENTATIONS USING SET AND HASH FIND MOTHER VERTEX IN A GRAPH TRANSITIVE CLOSURE OF A GRAPH USING DFS FIND K CORES OF AN UNDIRECTED GRAPH ITERATIVE DEPTH FIRST SEARCH COUNT THE NUMBER OF NODES AT GIVEN LEVEL IN A TREE USING BFS INTRODUCTION, DFS AND BFS :
7. 7. • DETECT CYCLE IN A DIRECTED GRAPH • DETECT CYCLE IN AN UNDIRECTED GRAPH • DETECT CYCLE IN A DIRECT GRAPH USING COLORS • ASSIGN DIRECTIONS TO EDGES SO THAT THE DIRECTED GRAPH REMAINS ACYCLIC • DETECT A NEGATIVE CYCLE IN A GRAPH | (BELLMAN FORD) • CYCLES OF LENGTH N IN AN UNDIRECTED AND CONNECTED GRAPH GRAPH CYCLE :
8. 8. THANK YOU FOR WATCHING