Algorithms/Unweighted Graph Algorithms

From Wikibooks, the open-content textbooks collection

Top, Chapters: 1, 2, 3, 4, 5, 6, 7, 8, A

Contents 1 Representation of Graph 1.1 Adjacency Matrix 1.2 Adjacency LIst 1.3 Comparsion 2 Depth First Search 2.1 Pseudocode 2.2 Properties 2.3 Classification of Edge 2.3.1 Tree Edge 2.3.2 Backward Edge 2.3.3 Forward Edge 2.3.4 Cross Edge 3 Breadth First Search 3.1 Pseudocode 3.2 Example 3.3 Correctness 3.4 Analysis 4 Classical Graph Problems 4.1 Topological Sort 4.2 Strongly Connected Components 4.3 Articulation Vertex 4.4 Bridge 4.5 Diameter

[edit] Representation of Graph

[edit] Adjacency Matrix

[edit] Adjacency LIst

[edit] Comparsion

[edit] Depth First Search

[edit] Pseudocode

[edit] Properties

[edit] Classification of Edge

[edit] Tree Edge

[edit] Backward Edge

[edit] Forward Edge

[edit] Cross Edge

[edit] Breadth First Search

[edit] Pseudocode

[edit] Example

[edit] Correctness

[edit] Analysis

[edit] Classical Graph Problems

[edit] Topological Sort

[edit] Strongly Connected Components

[edit] Articulation Vertex

[edit] Bridge

[edit] Diameter