前向星与链式前向星- Graph


      前向星是以存储边的方式来存储图,先将边读入并存储在连续的数组中,然后按照边的起点进行排序,这样数组中起点相等的边就能够在数组中进行连续访问了。它的优点是实现简单,容易理解,缺点是需要在所有边都读入完毕的情况下对所有边进行一次排序,带来了时间开销,实用性也较差,只适合离线算法。图一-2-4展示了图一-2-1的前向星表示法。
http://www.xuebuyuan.com/2064865.html
        前向星是一种用来存储图的数据结构。它的构造方式很简单,读入每条边的信息,然后存到数组中,然后将数组排序,排序方法是按照起点顺序排序,若起点相同则按终点顺序排序,如果终点相同则按权重排序(如果有权重)。另外,为了方便查询,会用一个数组head[]存储起点为v的第一条边的位置。
const int maxn=100+10;
const int maxm=1000+10;
int head[maxn];   //存储起点为i的第一条边的位置
int n,m;
struct NODE
{
    int from;      //起点
    int to;        //终点
    bool operator < (const NODE & a) const
    {
        return (from==a.from&&to<a.to)||from<a.from;
    }
};
NODE edge[maxm];
void Init()
{
    for(int i=0;i<m;++i)            //读入数据
        cin>>edge[i].from>>edge[i].to;
    sort(edge,edge+m);              //排序
    memset(head,-1,sizeof(head));
    head[edge[0].from]=0;
    for(int i=1;i<m;++i)
      if(edge[i].from!=edge[i-1].from) head[edge[i].from]=i;
}
void solve()      //遍历整个图
{
    for(int i=1;i<=n;++i)
    {
        for(k=head[i];edge[k].from==i&&k<m;++k)
        {
            cout<<edge[k].from<<" "<<edge[k].to<<endl;
        }
    }
} 
        前向星的优点是可以应对点非常多的情况,并且可以存储重边,缺点是效率相对来说不是非常高,因为它不能直接找到两点之间是否有边,而且还要排序,比较浪费时间。
链式前向星的结构也很简单,需要存储的信息有终点和与此边拥有相同起点的前一条边所在的位置next。构造方法使用类似于链表一样的方法将所有起点相同边连起来,head数组中存储最开始的一条边的位置,这样就能通过它找到所有的边。
  链式前向星的构成由一个结构体(包括目标点、边权值和下一个同起点的边)和head数组(用于存放某点的第一条出边),必要的时候还可以添加一个统计入度的数组,因为进行BFS DFS的时候是依靠点的出度和出边的邻接关系来进行的。假如有多于一个点的入度为0,那么将只能遍历到其中一个点以及往后的内容。
  对于链式前向星,总的一句话:链式前向星每添加一条边就会更新head数组,使得head数组存放的总是最新添加的某点的出边,此出边的next总指向head数组之前存放的出边的序号。
 1 typedef struct Edge {
 2     int v;   //到达点
 3     int w;   //边权值
 4     int next;//当前起点的下一条边的起始edge的序号
 5     Edge() { next = -1; }
 6     Edge(int vv, int ww) : v(vv), w(ww) { next = -1; }
 7 }Edge;
 8 
 9 const int maxn = 1111111;
10 
11 int n, m;  //n个点标号为1-n,有m条边
12 int vis[maxn];  //用于标记某边是否被遍历到,用于解决环的问题
13 
14 int cnt;   //边的数量
15 int dig[maxn];//有一种特殊情况:某点的入度为0,这样利用边与出度点的关系是便利不到的,因此我们特殊考虑。统计点的入度
16 int head[maxn]; //每个顶点的边集数组的第一个存储位置
17 Edge edge[maxn];//链式前向星存储边集
18 
19 void init() { //每次添加边的时候,head存储的都是起点添加的最后一条边
20     memset(vis, 0, sizeof(vis));
21     memset(edge, 0, sizeof(edge));
22     memset(dig, 0, sizeof(dig));
23     memset(head, -1, sizeof(head)); //因edge从0计数,用于区分
24     cnt = 0;
25 }
复制代码

  接下来考虑添加边的方式,每次更新cnt位置的结构体,并且更新head数组的对应值:
复制代码
1 void adde(int uu, int vv, int ww) { //添加边
2     dig[vv]++;  //边指向点入度加一
3     edge[cnt].v = vv;
4     edge[cnt].w = ww;
5     edge[cnt].next = head[uu];  //使要添加的边的指向下一条边的变量存下当前head中对应点的数
6     head[uu] = cnt++;   //记下当前边在edge数组的位置,并且作为头传递给head数组
7 }
复制代码

  还有BFS和DFS,利用链式前向星的点和边的关系,很容易地得出遍历的方式。与邻接表非常相似:
复制代码
 1 //根据链式前向星的特性,每个边存的是同一个起点出发的下一条边,
 2 //只需要遍历每一个点再从每一个点开始的头边向后扫描即可按照bfs的顺序遍历所有的边
 3 void bfs_edge() {
 4     int s = 1;
 5     queue<int> q;
 6     while(!q.empty()) q.pop();
 7     for(int i = 1; i <= n; i++) {
 8         if(head[i] != -1) {
 9             s = i;
10             break;
11         }
12     }
13     for(int i = 1; i <= n; i++) {   //特判入度为0的点,也遍历到。
14         if(!dig[i] && i != s) {
15             // printf("%d ", i);
16             q.push(i);
17         }
18     }
19     q.push(s);  //找到第一个出度不为0的点后,作为起点并入栈。
20     memset(vis, 0, sizeof(vis));//初始化vis数组
21     while(!q.empty()) {
22         int u = q.front(); q.pop();
23         for(int i = head[u]; ~i; i=edge[i].next) {  //遍历每一条以u为起点的边
24             if(!vis[i]) {   //如果当前边未遍历到
25                 vis[i] = 1; //设置为已遍历过
26                 printf("from %d to %d w %d\n", u, edge[i].v, edge[i].w);//输出遍历结果
27                 q.push(edge[i].v);//将此边的目标点放入队列
28             }
29         }
30     }
31 }
32 
33 //与bfs_edge同理,不过遍历到每一个边的时候,用vis数组对遍历到的边节点
34 //所指向的下一个点进行标记就可以对点进行bfs了
35 void bfs_vertex() {
36     printf("BFS the vertex:\n");
37     int s = 1;
38     queue<int> q;
39     while(!q.empty()) q.pop();
40     for(int i = 1; i <= n; i++) {
41         if(head[i] != -1) {
42             s = i;
43             break;
44         }
45     }
46     for(int i = 1; i <= n; i++) {   //特判入度为0的点,也遍历到。
47         if(!dig[i] && i != s) {
48             printf("%d ", i);
49         }
50     }
51     q.push(s);  //找到第一个出度不为0的点后,作为起点并入栈。
52     memset(vis, 0, sizeof(vis));//初始化vis数组
53     printf("%d ", s);
54     while(!q.empty()) {
55         int u = q.front(); q.pop(); //取头队列头部的点,进行遍历
56         vis[u] = 1; //记下当前点为遍历到
57         for(int i = head[u]; ~i; i=edge[i].next) { //遍历此点的出边
58             if(!vis[edge[i].v]) {   //如果出边目标点未被遍历到
59                 vis[edge[i].v] = 1; //设置为已遍历 并输出遍历结果
60                 printf("%d ", edge[i].v);
61                 q.push(edge[i].v);  //将此点放入队中
62             }
63         }
64     }
65     printf("\n");
66 }
67 
68 void _dfs(int u) {//dfs的辅助函数,用于递归遍历最深处的点
69     vis[u] = 1;  //此点为遍历到,设置为已遍历
70     for(int i = head[u]; ~i; i=edge[i].next) {//遍历所有此点的出边
71         if(!vis[edge[i].v]) {   //如果下一个点未被遍历到
72             vis[edge[i].v] = 1; //设置为已遍历
73             _dfs(edge[i].v);    //递归地调用,以此点为起点向下寻找未被遍历到的点
74         }
75     }
76     printf("%d ", u);   //此处输出,因为dfs是先输出最深处的点
77 }
78 
79 void dfs_vertex() {
80     printf("DFS the vertex:\n");
81     int s = 1;
82     for(int i = 1; i <= n; i++) {
83         if(head[i] != -1) {
84             s = i;
85             break;
86         }
87     }   //查找第一个出度非零的点并执行dfs的辅助函数
88     for(int i = 1; i <= n; i++) {   //特判入度为0的点,也遍历到。
89         if(!dig[i] && i != s) {
90             printf("%d ", i);
91         }
92     }
93     memset(vis, 0, sizeof(vis));
94     _dfs(s);
95 }



Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts