CRAN Package Check Results for Package DiagrammeR

Last updated on 2019-03-27 00:47:52 CET.

Flavor Version Tinstall Tcheck Ttotal Status Flags
r-devel-linux-x86_64-debian-clang 1.0.0 22.31 185.61 207.92 ERROR
r-devel-linux-x86_64-debian-gcc 1.0.0 22.15 143.76 165.91 ERROR
r-devel-linux-x86_64-fedora-clang 1.0.0 256.30 ERROR
r-devel-linux-x86_64-fedora-gcc 1.0.0 251.23 ERROR
r-devel-windows-ix86+x86_64 1.0.0 36.00 205.00 241.00 ERROR
r-patched-linux-x86_64 1.0.0 16.27 187.28 203.55 OK
r-patched-solaris-x86 1.0.0 321.00 NOTE
r-release-linux-x86_64 1.0.0 17.88 187.17 205.05 OK
r-release-windows-ix86+x86_64 1.0.0 44.00 271.00 315.00 OK
r-release-osx-x86_64 1.0.0 NOTE
r-oldrel-windows-ix86+x86_64 1.0.0 18.00 229.00 247.00 OK
r-oldrel-osx-x86_64 1.0.0 NOTE

Check Details

Version: 1.0.0
Check: tests
Result: ERROR
     Running 'testthat.R' [38s/40s]
    Running the tests in 'tests/testthat.R' failed.
    Complete output:
     > library(testthat)
     > library(DiagrammeR)
     >
     > test_check("DiagrammeR")
     -- 1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123) ------
     graph$edges_df$weight not equal to c(3.3, 5.02, 4.13, 6.49, 6.03, 5.55).
     6/6 mismatches (average diff: 0.598)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 4.12 - 4.13 == -0.01
     [4] 6.40 - 6.49 == -0.09
     [5] 6.91 - 6.03 == 0.88
     [6] 6.26 - 5.55 == 0.71
    
     -- 2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181) ------
     graph$edges_df$weight not equal to c(3.3, 5.02, 6.49).
     3/3 mismatches (average diff: 0.663)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 6.40 - 6.49 == -0.09
    
     -- 3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237) ------
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 4.13, 6.83, 6.49, 6.03, 5.55, 3.8).
     9/9 mismatches (average diff: 1.78)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 4.12 - 4.13 == -0.01
     [5] 2.25 - 6.83 == -4.58
     [6] 6.40 - 6.49 == -0.09
     [7] 6.91 - 6.03 == 0.88
     [8] 6.26 - 5.55 == 0.71
     [9] 1.74 - 3.80 == -2.06
    
     -- 4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294) ------
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     -- 5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350) ------
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     -- 6. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_predecessors(graph = graph, node = 26) not equal to 1.
     1/1 mismatches
     [1] 15 - 1 == 14
    
     -- 7. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_successors(graph = graph, node = 1) not equal to 26.
     1/1 mismatches
     [1] 23 - 26 == -3
    
     == testthat results ===========================================================
     OK: 2050 SKIPPED: 0 FAILED: 7
     1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123)
     2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181)
     3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237)
     4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294)
     5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350)
     6. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#38)
     7. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#49)
    
     Error: testthat unit tests failed
     Execution halted
Flavor: r-devel-linux-x86_64-debian-clang

Version: 1.0.0
Check: tests
Result: ERROR
     Running ‘testthat.R’ [29s/39s]
    Running the tests in ‘tests/testthat.R’ failed.
    Complete output:
     > library(testthat)
     > library(DiagrammeR)
     >
     > test_check("DiagrammeR")
     ── 1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123) ──────
     graph$edges_df$weight not equal to c(3.3, 5.02, 4.13, 6.49, 6.03, 5.55).
     6/6 mismatches (average diff: 0.598)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 4.12 - 4.13 == -0.01
     [4] 6.40 - 6.49 == -0.09
     [5] 6.91 - 6.03 == 0.88
     [6] 6.26 - 5.55 == 0.71
    
     ── 2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181) ──────
     graph$edges_df$weight not equal to c(3.3, 5.02, 6.49).
     3/3 mismatches (average diff: 0.663)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 6.40 - 6.49 == -0.09
    
     ── 3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 4.13, 6.83, 6.49, 6.03, 5.55, 3.8).
     9/9 mismatches (average diff: 1.78)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 4.12 - 4.13 == -0.01
     [5] 2.25 - 6.83 == -4.58
     [6] 6.40 - 6.49 == -0.09
     [7] 6.91 - 6.03 == 0.88
     [8] 6.26 - 5.55 == 0.71
     [9] 1.74 - 3.80 == -2.06
    
     ── 4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     ── 5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     ── 6. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_predecessors(graph = graph, node = 26) not equal to 1.
     1/1 mismatches
     [1] 15 - 1 == 14
    
     ── 7. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_successors(graph = graph, node = 1) not equal to 26.
     1/1 mismatches
     [1] 23 - 26 == -3
    
     ══ testthat results ═══════════════════════════════════════════════════════════
     OK: 2050 SKIPPED: 0 FAILED: 7
     1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123)
     2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181)
     3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237)
     4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294)
     5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350)
     6. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#38)
     7. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#49)
    
     Error: testthat unit tests failed
     Execution halted
Flavor: r-devel-linux-x86_64-debian-gcc

Version: 1.0.0
Check: data for non-ASCII characters
Result: NOTE
     Note: found 1 marked UTF-8 string
Flavors: r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-patched-solaris-x86, r-release-osx-x86_64, r-oldrel-osx-x86_64

Version: 1.0.0
Check: tests
Result: ERROR
     Running ‘testthat.R’ [48s/114s]
    Running the tests in ‘tests/testthat.R’ failed.
    Complete output:
     > library(testthat)
     > library(DiagrammeR)
     >
     > test_check("DiagrammeR")
     ── 1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123) ──────
     graph$edges_df$weight not equal to c(3.3, 5.02, 4.13, 6.49, 6.03, 5.55).
     6/6 mismatches (average diff: 0.598)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 4.12 - 4.13 == -0.01
     [4] 6.40 - 6.49 == -0.09
     [5] 6.91 - 6.03 == 0.88
     [6] 6.26 - 5.55 == 0.71
    
     ── 2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181) ──────
     graph$edges_df$weight not equal to c(3.3, 5.02, 6.49).
     3/3 mismatches (average diff: 0.663)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 6.40 - 6.49 == -0.09
    
     ── 3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 4.13, 6.83, 6.49, 6.03, 5.55, 3.8).
     9/9 mismatches (average diff: 1.78)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 4.12 - 4.13 == -0.01
     [5] 2.25 - 6.83 == -4.58
     [6] 6.40 - 6.49 == -0.09
     [7] 6.91 - 6.03 == 0.88
     [8] 6.26 - 5.55 == 0.71
     [9] 1.74 - 3.80 == -2.06
    
     ── 4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     ── 5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     OMP: Warning #96: Cannot form a team with 24 threads, using 2 instead.
     OMP: Hint Consider unsetting KMP_DEVICE_THREAD_LIMIT (KMP_ALL_THREADS), KMP_TEAMS_THREAD_LIMIT, and OMP_THREAD_LIMIT (if any are set).
     ── 6. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_predecessors(graph = graph, node = 26) not equal to 1.
     1/1 mismatches
     [1] 15 - 1 == 14
    
     ── 7. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_successors(graph = graph, node = 1) not equal to 26.
     1/1 mismatches
     [1] 23 - 26 == -3
    
     ══ testthat results ═══════════════════════════════════════════════════════════
     OK: 2050 SKIPPED: 0 FAILED: 7
     1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123)
     2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181)
     3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237)
     4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294)
     5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350)
     6. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#38)
     7. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#49)
    
     Error: testthat unit tests failed
     Execution halted
Flavor: r-devel-linux-x86_64-fedora-clang

Version: 1.0.0
Check: tests
Result: ERROR
     Running ‘testthat.R’ [46s/179s]
    Running the tests in ‘tests/testthat.R’ failed.
    Complete output:
     > library(testthat)
     > library(DiagrammeR)
     >
     > test_check("DiagrammeR")
     ── 1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123) ──────
     graph$edges_df$weight not equal to c(3.3, 5.02, 4.13, 6.49, 6.03, 5.55).
     6/6 mismatches (average diff: 0.598)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 4.12 - 4.13 == -0.01
     [4] 6.40 - 6.49 == -0.09
     [5] 6.91 - 6.03 == 0.88
     [6] 6.26 - 5.55 == 0.71
    
     ── 2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181) ──────
     graph$edges_df$weight not equal to c(3.3, 5.02, 6.49).
     3/3 mismatches (average diff: 0.663)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 6.40 - 6.49 == -0.09
    
     ── 3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 4.13, 6.83, 6.49, 6.03, 5.55, 3.8).
     9/9 mismatches (average diff: 1.78)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 4.12 - 4.13 == -0.01
     [5] 2.25 - 6.83 == -4.58
     [6] 6.40 - 6.49 == -0.09
     [7] 6.91 - 6.03 == 0.88
     [8] 6.26 - 5.55 == 0.71
     [9] 1.74 - 3.80 == -2.06
    
     ── 4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     ── 5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350) ──────
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     ── 6. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_predecessors(graph = graph, node = 26) not equal to 1.
     1/1 mismatches
     [1] 15 - 1 == 14
    
     ── 7. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_successors(graph = graph, node = 1) not equal to 26.
     1/1 mismatches
     [1] 23 - 26 == -3
    
     ══ testthat results ═══════════════════════════════════════════════════════════
     OK: 2050 SKIPPED: 0 FAILED: 7
     1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123)
     2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181)
     3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237)
     4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294)
     5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350)
     6. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#38)
     7. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#49)
    
     Error: testthat unit tests failed
     Execution halted
Flavor: r-devel-linux-x86_64-fedora-gcc

Version: 1.0.0
Check: tests
Result: ERROR
     Running 'testthat.R' [40s]
    Running the tests in 'tests/testthat.R' failed.
    Complete output:
     > library(testthat)
     > library(DiagrammeR)
     >
     > test_check("DiagrammeR")
     -- 1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123) ------
     graph$edges_df$weight not equal to c(3.3, 5.02, 4.13, 6.49, 6.03, 5.55).
     6/6 mismatches (average diff: 0.598)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 4.12 - 4.13 == -0.01
     [4] 6.40 - 6.49 == -0.09
     [5] 6.91 - 6.03 == 0.88
     [6] 6.26 - 5.55 == 0.71
    
     -- 2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181) ------
     graph$edges_df$weight not equal to c(3.3, 5.02, 6.49).
     3/3 mismatches (average diff: 0.663)
     [1] 5.18 - 3.30 == 1.88
     [2] 5.00 - 5.02 == -0.02
     [3] 6.40 - 6.49 == -0.09
    
     -- 3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237) ------
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 4.13, 6.83, 6.49, 6.03, 5.55, 3.8).
     9/9 mismatches (average diff: 1.78)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 4.12 - 4.13 == -0.01
     [5] 2.25 - 6.83 == -4.58
     [6] 6.40 - 6.49 == -0.09
     [7] 6.91 - 6.03 == 0.88
     [8] 6.26 - 5.55 == 0.71
     [9] 1.74 - 3.80 == -2.06
    
     -- 4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294) ------
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     -- 5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350) ------
     graph$edges_df$weight not equal to c(8.66, 3.3, 5.02, 6.83, 6.49, 3.8).
     6/6 mismatches (average diff: 2.4)
     [1] 2.91 - 8.66 == -5.75
     [2] 5.18 - 3.30 == 1.88
     [3] 5.00 - 5.02 == -0.02
     [4] 2.25 - 6.83 == -4.58
     [5] 6.40 - 6.49 == -0.09
     [6] 1.74 - 3.80 == -2.06
    
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     Modularity is implemented for undirected graphs only.
     -- 6. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_predecessors(graph = graph, node = 26) not equal to 1.
     1/1 mismatches
     [1] 15 - 1 == 14
    
     -- 7. Failure: getting a node's predecessors/successors is possible (@test-prede
     get_successors(graph = graph, node = 1) not equal to 26.
     1/1 mismatches
     [1] 23 - 26 == -3
    
     == testthat results ===========================================================
     OK: 2050 SKIPPED: 0 FAILED: 7
     1. Failure: Adding a full graph is possible (@test-add_graphs.R#1123)
     2. Failure: Adding a full graph is possible (@test-add_graphs.R#1181)
     3. Failure: Adding a full graph is possible (@test-add_graphs.R#1237)
     4. Failure: Adding a full graph is possible (@test-add_graphs.R#1294)
     5. Failure: Adding a full graph is possible (@test-add_graphs.R#1350)
     6. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#38)
     7. Failure: getting a node's predecessors/successors is possible (@test-predecessors_successors.R#49)
    
     Error: testthat unit tests failed
     Execution halted
Flavor: r-devel-windows-ix86+x86_64

Version: 1.0.0
Check: package dependencies
Result: NOTE
    Package suggested but not available for checking: ‘rsvg’
Flavors: r-patched-solaris-x86, r-release-osx-x86_64

Version: 1.0.0
Check: installed package size
Result: NOTE
     installed size is 5.0Mb
     sub-directories of 1Mb or more:
     htmlwidgets 3.3Mb
Flavor: r-patched-solaris-x86