Possible solutions Solution l design an artificial small-world model which is easy to find such short chains Solution 2: design a search algorithm to find such short chains in real-world small-world networks What 's the difference between these two?
Possible Solutions • Solution 1: design an artificial small-world model which is easy to find such short chains; • Solution 2: design a search algorithm to find such short chains in real-world small-world networks. • What’s the difference between these two?
4 昵图网 nipic. com/rzzx Where is the next step?
Where is the next step?
Recall: Search in graphs · Binary Tree(二叉树) Traversal(遍历) Preorder/norder/Postorder traversal (前序遍历/中序遍历/后序遍历) Depth- first-search/深度优先搜索 Breadth- first-search/广度优先搜索
Recall: Search in graphs • Binary Tree ( 二叉树) Traversal (遍历): Preorder/Inorder/Postorder Traversal (前序遍历/中序遍历/后序遍历) • Depth-first-search/深度优先搜索 • Breadth-first-search/广度优先搜索
Traversal N: nodes itself L: left subtrees R: right subtrees L→R Preorder Traversal: VO->V1->V3->V4->V7->V2->V5->V6 NLR Inorder Traversal: V3->V1->v4->V7->V0-2V5->V2->v6 LNR Postorder Traversal: V3->V7->v4->V1->V5->V6->V2->vO LRN
Traversal Preorder Traversal: V0->V1->V3->V4->V7->V2->V5->V6 Inorder Traversal: Postorder Traversal: N L R L N R L R N N: nodes itself L: left subtrees R: right subtrees L R V3->V1->V4->V7->V0->V5->V2->V6 V3->V7->V4->V1->V5->V6->V2->V0
Breadth-first-search V4 V5 v6 V7 V0->V1-V2->V3->V4->V5->V6->V7
Breadth-first-search • V0->V1->V2->V3->V4->V5->V6->V7