Graph

Graph

A graph is a pair (V, E), where V is a set of nodes, called vertices, and £ is a collection of pairs of vertices, called edges.

• Vertices and edges are positions and store elements

Terms related to Graph

Directed edge:

• ordered pair of vertices (u, v)

• first vertex u is the origin

• second vertex v is the destination

• Example: one-way road traffic

Undirected edge:

• unordered pair of vertices (u, v)

• Example: railway lines

Directed graph:

• all the edges are directed

• Example: route network

Undirected graph:

• all the edges are undirected

• Example: flight network

Questions :

• Breath First Search ----> C++ | Java | Python
• Depth First Search ----> C++ | Java | Python
• Dijkstra Algorithm ----> C++ | Java | Python
• Kruskal Algorithm ----> C++ | Java | Python
• Topological Sort ----> C++ | Java | Python
• Bellman Ford ----> Python
• Dijkstra Algorithm ----> C++ | Java | Python
• Floyd Warshall Algorithm ----> C++ | Java | Python
• Kruskal Algorithm ----> C++ | Java | Python
• Largest-Cake-Piece ----> C++
• Longest Path in a Directed Acyclic Graph ----> C++ | Java | Python
• Negative Cycle In weighted Graph (Using Bellman–Ford algorithm) ---> C++ | Java | Python
• Prim's Algorithm ----> C++ | Java | Python
• Strongly Connected Components (Using Kosaraju Algorithm) ----> C++
• Strongly Connected Components (Using Tarjans Algorithm) ----> C++ | Java
• Subtree Size ----> C++ | Java | Python
• Topological Sort ----> C++ | Java | Python
• Shortest Distance Using Bellman Ford --> C++ | Java | Python
• Articulation-Point(Cut-Vertex) ----> C++