Algorithms/Unweighted Graph Algorithms

From Wikibooks, the open-content textbooks collection

< Algorithms(Redirected from Algorithms/Chapter 9)
Jump to: navigation, search

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

Contents

[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