Graphs
Graphs
Representation and applications
- A graph G=(V,E) consists of V, a non empty set of vertices (or nodes) and E, a set of edges...}
Graphs
Transitive Closure
- The transitive closure of a graph G connects u and v iff there is a path in G from u to v.<...}
Graphs
Warshall’s Algorithm
- The Floyd–Warshall algorithm is used for finding shortest paths in a weighted graph w...}
Graphs
Graph Traversal and Spanning Forests
- In computer science, graph traversal is the process of visiting (checking and/or updating)...}
Graphs
Depth First Traversal and Breadth First Traversal
- The essential feature of DFT is that when a node is visited, all descendent of the node are...}
Graphs
Minimum Spanning Trees, Prim’s, Kruskal’s and Round‐ Robin Algorithms
- A Minimum Spanning Tree (MST) is a subgraph of an undirected graph such that the subgraph s...}
Graphs
Shortest‐Path Algorithm
- In graph theory, the shortest path problem is the problem of finding a path between two ver...}
Graphs
Greedy algorithm
- A greedy algorithm is an algorithm that follows the problem solving heuristic of making the...}
Graphs
Dijkstra's Algorithm
- Dijkstra's Algorithm solves the single-source shortest path problem for a non-negative weig...}