Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
zhhf96
C-Plus-Plus-TheAlgorithms
提交
36f1d332
C
C-Plus-Plus-TheAlgorithms
项目概览
zhhf96
/
C-Plus-Plus-TheAlgorithms
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
C-Plus-Plus-TheAlgorithms
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
36f1d332
编写于
8月 16, 2020
作者:
F
Filip Hlasek
提交者:
GitHub
8月 16, 2020
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fix: linter for kosaraju (#1035)
* fix: linter for kosaraju * update doxygen parameters
上级
91ce393c
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
47 addition
and
40 deletion
+47
-40
graph/kosaraju.cpp
graph/kosaraju.cpp
+47
-40
未找到文件。
graph/kosaraju.cpp
浏览文件 @
36f1d332
...
...
@@ -4,77 +4,84 @@
#include <iostream>
#include <vector>
#include <stack>
using
namespace
std
;
/**
* Iterative function/method to print graph:
* @param a
[] : array of vectors (2D)
* @param V
:
vertices
* @param a
adjacency list representation of the graph
* @param V
number of
vertices
* @return void
**/
void
print
(
vector
<
int
>
a
[]
,
int
V
)
{
void
print
(
const
std
::
vector
<
std
::
vector
<
int
>
>
&
a
,
int
V
)
{
for
(
int
i
=
0
;
i
<
V
;
i
++
)
{
if
(
!
a
[
i
].
empty
())
cout
<<
"i="
<<
i
<<
"-->"
;
for
(
int
j
=
0
;
j
<
a
[
i
].
size
();
j
++
)
cout
<<
a
[
i
][
j
]
<<
" "
;
if
(
!
a
[
i
].
empty
())
cout
<<
endl
;
if
(
!
a
[
i
].
empty
())
{
std
::
cout
<<
"i="
<<
i
<<
"-->"
;
}
for
(
int
j
:
a
[
i
])
{
std
::
cout
<<
j
<<
" "
;
}
if
(
!
a
[
i
].
empty
())
{
std
::
cout
<<
std
::
endl
;
}
}
}
/**
* //Recursive function/method to push vertices into stack passed as parameter:
* @param v
:
vertices
* @param
&st :
stack passed by reference
* @param vis
[] :
array to keep track of visited nodes (boolean type)
* @param adj
[] : array of vectors to represent
graph
* @param v vertices
* @param
st
stack passed by reference
* @param vis array to keep track of visited nodes (boolean type)
* @param adj
adjacency list representation of the
graph
* @return void
**/
void
push_vertex
(
int
v
,
st
ack
<
int
>
&
st
,
bool
vis
[],
vector
<
int
>
adj
[]
)
{
vis
[
v
]
=
true
;
void
push_vertex
(
int
v
,
st
d
::
stack
<
int
>
*
st
,
std
::
vector
<
bool
>
*
vis
,
const
std
::
vector
<
std
::
vector
<
int
>
>
&
adj
)
{
(
*
vis
)
[
v
]
=
true
;
for
(
auto
i
=
adj
[
v
].
begin
();
i
!=
adj
[
v
].
end
();
i
++
)
{
if
(
vis
[
*
i
]
==
false
)
if
(
(
*
vis
)[
*
i
]
==
false
)
{
push_vertex
(
*
i
,
st
,
vis
,
adj
);
}
}
st
.
push
(
v
);
st
->
push
(
v
);
}
/**
* //Recursive function/method to implement depth first traversal(dfs):
* @param v
:
vertices
* @param vis
[] :
array to keep track of visited nodes (boolean type)
* @param grev
[] :
graph with reversed edges
* @param v vertices
* @param vis array to keep track of visited nodes (boolean type)
* @param grev graph with reversed edges
* @return void
**/
void
dfs
(
int
v
,
bool
vis
[],
vector
<
int
>
grev
[]
)
{
vis
[
v
]
=
true
;
void
dfs
(
int
v
,
std
::
vector
<
bool
>
*
vis
,
const
std
::
vector
<
std
::
vector
<
int
>
>
&
grev
)
{
(
*
vis
)
[
v
]
=
true
;
// cout<<v<<" ";
for
(
auto
i
=
grev
[
v
].
begin
();
i
!=
grev
[
v
].
end
();
i
++
)
{
if
(
vis
[
*
i
]
==
false
)
if
(
(
*
vis
)[
*
i
]
==
false
)
{
dfs
(
*
i
,
vis
,
grev
);
}
}
}
// function/method to implement Kosaraju's Algorithm:
/**
* Info about the method
* @param V
:
vertices in graph
* @param adj
[] :
array of vectors that represent a graph (adjacency list/array)
* @param V vertices in graph
* @param adj array of vectors that represent a graph (adjacency list/array)
* @return int ( 0, 1, 2..and so on, only unsigned values as either there can be
no SCCs i.e. none(0) or there will be x no. of SCCs (x>0)) i.e. it returns the
count of (number of) strongly connected components (SCCs) in the graph.
(variable 'count_scc' within function)
**/
int
kosaraju
(
int
V
,
vector
<
int
>
adj
[]
)
{
bool
vis
[
V
]
=
{}
;
stack
<
int
>
st
;
int
kosaraju
(
int
V
,
const
std
::
vector
<
std
::
vector
<
int
>
>
&
adj
)
{
std
::
vector
<
bool
>
vis
(
V
,
false
)
;
st
d
::
st
ack
<
int
>
st
;
for
(
int
v
=
0
;
v
<
V
;
v
++
)
{
if
(
vis
[
v
]
==
false
)
push_vertex
(
v
,
st
,
vis
,
adj
);
if
(
vis
[
v
]
==
false
)
{
push_vertex
(
v
,
&
st
,
&
vis
,
adj
);
}
}
// making new graph (grev) with reverse edges as in adj[]:
vector
<
int
>
grev
[
V
]
;
std
::
vector
<
std
::
vector
<
int
>
>
grev
(
V
)
;
for
(
int
i
=
0
;
i
<
V
+
1
;
i
++
)
{
for
(
auto
j
=
adj
[
i
].
begin
();
j
!=
adj
[
i
].
end
();
j
++
)
{
grev
[
*
j
].
push_back
(
i
);
...
...
@@ -89,7 +96,7 @@ int kosaraju(int V, vector<int> adj[]) {
int
t
=
st
.
top
();
st
.
pop
();
if
(
vis
[
t
]
==
false
)
{
dfs
(
t
,
vis
,
grev
);
dfs
(
t
,
&
vis
,
grev
);
count_scc
++
;
}
}
...
...
@@ -101,21 +108,21 @@ int kosaraju(int V, vector<int> adj[]) {
// All critical/corner cases have been taken care of.
// Input your required values: (not hardcoded)
int
main
()
{
int
t
;
cin
>>
t
;
int
t
=
0
;
std
::
cin
>>
t
;
while
(
t
--
)
{
int
a
,
b
;
// a->number of nodes, b->directed edges.
cin
>>
a
>>
b
;
int
m
,
n
;
vector
<
int
>
adj
[
a
+
1
]
;
int
a
=
0
,
b
=
0
;
// a->number of nodes, b->directed edges.
std
::
cin
>>
a
>>
b
;
int
m
=
0
,
n
=
0
;
std
::
vector
<
std
::
vector
<
int
>
>
adj
(
a
+
1
)
;
for
(
int
i
=
0
;
i
<
b
;
i
++
)
// take total b inputs of 2 vertices each
// required to form an edge.
{
cin
>>
m
>>
n
;
// take input m,n denoting edge from m->n.
std
::
cin
>>
m
>>
n
;
// take input m,n denoting edge from m->n.
adj
[
m
].
push_back
(
n
);
}
// pass number of nodes and adjacency array as parameters to function:
cout
<<
kosaraju
(
a
,
adj
)
<<
endl
;
std
::
cout
<<
kosaraju
(
a
,
adj
)
<<
std
::
endl
;
}
return
0
;
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录