Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
A
Appunti
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Gianluca Mastrolonardo
Appunti
Commits
c25d402c
Commit
c25d402c
authored
10 months ago
by
Gianluca
Browse files
Options
Downloads
Patches
Plain Diff
es4 finito
parent
3e451b14
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
Algoritmi_2/Laboratorio/Lab5/Test/TestKosaraju.java
+25
-3
25 additions, 3 deletions
Algoritmi_2/Laboratorio/Lab5/Test/TestKosaraju.java
Algoritmi_2/Laboratorio/Lab5/src/Kosaraju.java
+7
-11
7 additions, 11 deletions
Algoritmi_2/Laboratorio/Lab5/src/Kosaraju.java
with
32 additions
and
14 deletions
Algoritmi_2/Laboratorio/Lab5/Test/TestKosaraju.java
+
25
−
3
View file @
c25d402c
...
...
@@ -5,6 +5,8 @@ import org.junit.jupiter.api.Test;
import
java.util.ArrayList
;
import
java.util.Arrays
;
import
java.util.Collections
;
import
java.util.Objects
;
public
class
TestKosaraju
{
...
...
@@ -28,8 +30,28 @@ class TestKosaraju {
@Test
void
testGetSCC
()
{
DirectedGraph
g
=
new
DirectedGraph
(
"5; 1 4; 4 3; 3 1; 1 2; 4 0; 2 0; 0 2;"
);
Kosaraju
kosaraju
=
new
Kosaraju
(
g
);
System
.
out
.
println
(
Arrays
.
toString
(
kosaraju
.
getSCC
()));
DirectedGraph
gOneNode
=
new
DirectedGraph
(
1
);
Kosaraju
kosarajuOneNode
=
new
Kosaraju
(
gOneNode
);
Assertions
.
assertEquals
(
kosarajuOneNode
.
getSCC
()[
0
],
0
);
DirectedGraph
dag
=
new
DirectedGraph
(
"4; 0 2; 0 1; 1 2; 1 3"
);
Kosaraju
kosarajuDag
=
new
Kosaraju
(
dag
);
int
[]
expectedSCCDag1
=
{
0
,
1
,
3
,
2
};
int
[]
expectedSCCDag2
=
{
0
,
1
,
2
,
3
};
Assertions
.
assertTrue
(
Arrays
.
equals
(
kosarajuDag
.
getSCC
(),
expectedSCCDag1
)
||
Arrays
.
equals
(
kosarajuDag
.
getSCC
(),
expectedSCCDag2
));
DirectedGraph
gOneCycle
=
new
DirectedGraph
(
"3; 0 1; 1 2; 2 0"
);
Kosaraju
kosarajuOneCycle
=
new
Kosaraju
(
gOneCycle
);
for
(
int
i
=
0
;
i
<
kosarajuOneCycle
.
getSCC
().
length
;
i
++)
{
Assertions
.
assertEquals
(
kosarajuOneCycle
.
getSCC
()[
i
],
0
);
}
DirectedGraph
gBig
=
new
DirectedGraph
(
"5; 1 4; 4 3; 3 1; 1 2; 4 0; 2 0; 0 2;"
);
Kosaraju
kosarajuBig
=
new
Kosaraju
(
gBig
);
Assertions
.
assertEquals
(
kosarajuBig
.
getSCC
()[
0
],
kosarajuBig
.
getSCC
()[
2
]);
Assertions
.
assertEquals
(
kosarajuBig
.
getSCC
()[
1
],
kosarajuBig
.
getSCC
()[
3
]);
Assertions
.
assertEquals
(
kosarajuBig
.
getSCC
()[
3
],
kosarajuBig
.
getSCC
()[
4
]);
Assertions
.
assertNotEquals
(
kosarajuBig
.
getSCC
()[
0
],
kosarajuBig
.
getSCC
()[
1
]);
}
}
This diff is collapsed.
Click to expand it.
Algoritmi_2/Laboratorio/Lab5/src/Kosaraju.java
+
7
−
11
View file @
c25d402c
...
...
@@ -12,7 +12,7 @@ class Kosaraju {
private
boolean
[]
founded
;
private
ArrayList
<
Integer
>
postVisitOrder
=
new
ArrayList
<>();
static
p
rivate
DirectedGraph
reversedGraph
;
static
p
ublic
DirectedGraph
reversedGraph
;
Kosaraju
(
DirectedGraph
g
)
{
this
.
myGraph
=
g
;
...
...
@@ -45,14 +45,15 @@ class Kosaraju {
return
reversePostVisitOrderArray
;
}
p
ublic
void
getSCCImpl
(
int
sorg
,
int
cnt
)
{
p
rivate
void
visitaDFSOnReversedGraph
(
int
sorg
,
int
[]
scc
,
int
cnt
)
{
founded
[
sorg
]
=
true
;
for
(
Integer
neighbor
:
my
Graph
.
getNeighbors
(
sorg
))
{
for
(
Integer
neighbor
:
reversed
Graph
.
getNeighbors
(
sorg
))
{
if
(!
founded
[
neighbor
])
{
getSCCImpl
(
neighbor
,
cnt
);
visitaDFSOnReversedGraph
(
neighbor
,
scc
,
cnt
);
}
}
scc
[
sorg
]
=
cnt
;
}
public
...
...
@@ -62,13 +63,8 @@ class Kosaraju {
ArrayList
<
Integer
>
reversePostVisitOrderArray
=
reversePostVisitOrder
();
Arrays
.
fill
(
founded
,
false
);
for
(
Integer
node
:
reversePostVisitOrderArray
)
{
postVisitOrder
.
clear
();
//Uso l'array del OFV solo per sapere che nodi ho scoperto
if
(!
founded
[
node
])
{
visitaDFS
(
node
);
ArrayList
<
Integer
>
foundedNode
=
postVisitOrder
;
for
(
int
foundednode
:
foundedNode
)
{
SCC
[
foundednode
]
=
cnt
;
}
visitaDFSOnReversedGraph
(
node
,
SCC
,
cnt
);
cnt
++;
}
}
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment