leetcode::critical_connections_in_a_network::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< vector< int > >	criticalConnections (int n, vector< vector< int > > &connections)
static void	tarjan (int prev, int &step, vector< int > &dfn, int node, vector< unordered_set< int > > &g, vector< int > &low, vector< vector< int > > &ans)

详细描述

在文件 leetcode.h 第 2948 行定义.

成员函数说明

criticalConnections()

vector< vector< int > > leetcode::critical_connections_in_a_network::Solution::criticalConnections ( int n, vector< vector< int > > & connections )

static

在文件 leetcode.cpp 第 8211 行定义.

                                                                                                 {
            vector<unordered_set<int>> g(n);
            for(auto &conn: connections) {
                g[conn[0]].insert(conn[1]);
                g[conn[1]].insert(conn[0]);
            }
            vector<vector<int>> ans;
            vector dfn(n, -1);
            vector low(n, -1);
            unordered_set<int> vis;
            int step = 0;
            for(int i = 0; i < n; i++) {
                if(dfn[i] == -1) {
                    step = 0;
                    tarjan(-1, step, dfn, i, g, low, ans);
                }
            }
            return ans;
        }

引用了 tarjan().

被这些函数引用 leetcode::critical_connections_in_a_network::TEST(), leetcode::critical_connections_in_a_network::TEST() , 以及 leetcode::critical_connections_in_a_network::TEST().

tarjan()

void leetcode::critical_connections_in_a_network::Solution::tarjan ( int prev, int & step, vector< int > & dfn, int node, vector< unordered_set< int > > & g, vector< int > & low, vector< vector< int > > & ans )

static

在文件 leetcode.cpp 第 8231 行定义.

                                                                                                                                                        {
            dfn[node] = step;
            low[node] = step;
            for(const auto &next: g[node]) {
                if(dfn[next] == -1) {
                    tarjan(node, ++step, dfn, next, g, low, ans);
                }
                if(next != prev) {
                    low[node] = min(low[node], low[next]);
                }
                if(dfn[node] < low[next]) {
                    ans.push_back({node, next});
                }
            }
        }

引用了 tarjan().

被这些函数引用 criticalConnections() , 以及 tarjan().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp