Please enable JavaScript.
Coggle requires JavaScript to display documents.
graph (shortest path problem (bellman-ford algo, floyd-warshall algo,…
graph
shortest path problem
bellman-ford algo
floyd-warshall algo
dijkstra's algo(algo版)
A+、A*矩陣
dijkstra's algo(DS版)
graph的4種表示方式
adjancency lists(相鄰串連)
adjancency multilists(相鄰多元串列)
adjancency matrix(相鄰矩陣)
index+array
AOV network、
Topological sort
topological sort
steps
定義
所有topological sort有幾組
articulation point、
Biconnected gragh、
Biconnected component
Biconnected gragh定義、例子
Biconnected component定義、例子
articulation point定義、例子
如何找出articulation point?
graph traversal
DFS(depth first search)
BFS(breadth first search)
其他：比較表、補充、algo版、
DFS(針對有向圖)、edges種類、圖形追蹤之應用
graph
種類
無向圖
有向圖
相關術語
定義
spanning tree
定義
例子
notes
min spanning tree
定義
求min spanning tree之3個algo.
kruskal's algo
prim's algo
sollin's algo
AOE network、
critical path、
critical task
定義、意義
例子