Graph Theory
From Algorithmist
This page should contain an introduction to graphs (what they are, how they look like, what can be represented as a graph, etc.) and links to various parts of Graph Theory.
[edit] Interesting parts of Graph Theory
- Basic definitions
- Graph data structures
- Graph searching and connectedness
- Shortest path problems
- Trees, Spanning trees
- Bipartite graphs
- Biconnectivity
- Longest Path in a Graph
- Diameter of a Graph
- Matchings and flows
- Breadth-First Search
- Depth-First Search
... Besides few more advanced parts and algorithms of Graph theory
- Euler tour
- De Bruijn sequence
- Hamiltonian cycle
- Minimum Diameter Spanning Tree
- Maximum Bipartite Matching
[edit] Further reading
- Wikibooks: Graph theory
- The WikiNode network can be seen as a directed graph over nearly all wiki.
- Wikipedia: graph theory
