Searched refs:nEndNodes (Results 1 – 2 of 2) sorted by relevance
| /dports/biology/gatk/gatk-4.2.0.0/src/test/java/org/broadinstitute/hellbender/tools/walkers/haplotypecaller/graphs/ |
| H A D | GraphBasedKBestHaplotypeFinderUnitTest.java | 123 for ( final int nEndNodes : Arrays.asList(1, 2, 3) ) { in makeBasicPathFindingData()
124 tests.add(new Object[]{nStartNodes, nBranchesPerBubble, nEndNodes}); in makeBasicPathFindingData()
146 …id testBasicPathFinding(final int nStartNodes, final int nBranchesPerBubble, final int nEndNodes) { in testBasicPathFinding() argument
155 final Set<SeqVertex> ends = createVertices(graph, nEndNodes, middleBottom, null); in testBasicPathFinding()
157 final int expectedNumOfPaths = nStartNodes * nBranchesPerBubble * nEndNodes; in testBasicPathFinding()
|
| H A D | JunctionTreeKBestHaplotypeFinderUnitTest.java | 757 for ( final int nEndNodes : Arrays.asList(1, 2, 3) ) { in makeBasicPathFindingData()
758 tests.add(new Object[]{nStartNodes, nBranchesPerBubble, nEndNodes}); in makeBasicPathFindingData()
781 …hFindingNoJunctionTrees(final int nStartNodes, final int nBranchesPerBubble, final int nEndNodes) { in testBasicPathFindingNoJunctionTrees() argument
790 final Set<MultiDeBruijnVertex> ends = createVertices(graph, nEndNodes, middleBottom, null); in testBasicPathFindingNoJunctionTrees()
792 final int expectedNumOfPaths = nStartNodes * nBranchesPerBubble * nEndNodes; in testBasicPathFindingNoJunctionTrees()
|