apache/maven-mvnd
1
0
Fork 0
mirror of https://github.com/apache/maven-mvnd.git synced 2025-09-10 04:59:54 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

A test for DAG width wrong for triple interdependent graph #287

Browse Source
This commit is contained in:
Peter Palaga
2020-12-23 00:11:37 +01:00
parent ac3f5e266a
commit f046bb6119
1 changed files with 78 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

86
daemon/src/test/java/org/mvndaemon/mvnd/builder/DagWidthTest.java
View File

@@ -33,14 +33,18 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
public class DagWidthTest {
/**
* <pre>
* A B
* /|\ / \
* C D E F
* \|
* G
* </pre>
*/
@Test
void testSimpleGraph() {
//
// A B
// / | \ / \
// C D E F
// \/
// G
Map<String, List<String>> upstreams = new HashMap<>();
upstreams.put("A", Collections.emptyList());
upstreams.put("B", Collections.emptyList());
@@ -54,11 +58,77 @@ public class DagWidthTest {
assertEquals(4, new DagWidth<>(graph).getMaxWidth(12));
}
/**
* <pre>
* A
* /|
* B |
* \|
* C
* </pre>
*/
@Test
void tripleLinearGraph() {
Map<String, List<String>> upstreams = new HashMap<>();
upstreams.put("A", Collections.emptyList());
upstreams.put("B", Collections.singletonList("A"));
upstreams.put("C", Arrays.asList("A", "B"));
DependencyGraph<String> graph = newGraph(upstreams);
assertEquals(1, new DagWidth<>(graph).getMaxWidth());
}
/**
* <pre>
* A
* /|\
* B C D
* /|\ \|
* E F G H
* </pre>
*/
@Test
void multilevelSum() {
Map<String, List<String>> upstreams = new HashMap<>();
upstreams.put("A", Collections.emptyList());
upstreams.put("B", Collections.singletonList("A"));
upstreams.put("C", Collections.singletonList("A"));
upstreams.put("D", Collections.singletonList("A"));
upstreams.put("E", Collections.singletonList("B"));
upstreams.put("F", Collections.singletonList("B"));
upstreams.put("G", Collections.singletonList("B"));
upstreams.put("H", Arrays.asList("C", "D"));
DependencyGraph<String> graph = newGraph(upstreams);
assertEquals(5, new DagWidth<>(graph).getMaxWidth());
}
/**
* <pre>
* A
* /|\
* B C D
* |
* E
* </pre>
*/
@Test
void wide() {
Map<String, List<String>> upstreams = new HashMap<>();
upstreams.put("A", Collections.emptyList());
upstreams.put("B", Collections.singletonList("A"));
upstreams.put("C", Collections.singletonList("A"));
upstreams.put("D", Collections.singletonList("A"));
upstreams.put("E", Collections.singletonList("D"));
DependencyGraph<String> graph = newGraph(upstreams);
assertEquals(3, new DagWidth<>(graph).getMaxWidth());
}
/**
* <pre>
* A
* </pre>
*/
@Test
void testSingle() {
//
// A
//
Map<String, List<String>> upstreams = new HashMap<>();
upstreams.put("A", Collections.emptyList());
DependencyGraph<String> graph = newGraph(upstreams);