https://github.com/rogerchern/graphalgorithms
C++ 11 impelemention of Graph Algorithms from Sedgewick's Algotirhms 4th
https://github.com/rogerchern/graphalgorithms
Last synced: about 1 year ago
JSON representation
C++ 11 impelemention of Graph Algorithms from Sedgewick's Algotirhms 4th
- Host: GitHub
- URL: https://github.com/rogerchern/graphalgorithms
- Owner: RogerChern
- Created: 2014-08-24T01:31:21.000Z (almost 12 years ago)
- Default Branch: master
- Last Pushed: 2018-04-25T03:34:22.000Z (about 8 years ago)
- Last Synced: 2025-03-30T11:05:17.938Z (over 1 year ago)
- Language: C++
- Size: 436 KB
- Stars: 5
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
GraphAlgorithms
===============
Modern C++ implementation of Graph Algorithms for Sedgewick's *Algotirhms 4th*
When I say modern C++, I mean C++11/14
Currently version 1.0 has come out
the list below shows the data structure and algorithms has been implemented.
## Auxliary
### String Process
split method
### IndexPriorityQueue
this structure is quite a little bit fuzzy, read the source code to gain more info
### UnionFind
Weighted quick-union with path compression
## Undirected Unweighted Graph
using vector> adjList as core structure
### BFS/DFS on UUG
BFS features a queue structure while DFS takes advantage of system call stack
### CC on UUG
using DFS
### Search/FindPath on CC
using DFS
### SymbolGraph
using a map string ---> index
## Directed Unweighted Graph
also using vector> adjList as core structure
### BFS/DFS on DUG
### Cycle Detection
### SymbolDiGraph
### SCC
## Mimimum Spanning Tree
### Lazy Prim
### Eager Prim(using IndexPQ)
### Kruskal
## Shortest Path
### Dijkstra
### Topological Order for DAG
### BellmanFord