✔ Ctor_Preconditions

6ms

✔ Equals_IsByValueWithStrings

2ms

✔ Equals_IsByValueWithListOfChar

< 1ms

✔ Equals_IsByValueWithEnumerableOfChar

< 1ms

✔ Indexer_WithSelector

1ms

✔ Indexer_WithRangeOfString

< 1ms

✔ Indexer_WithRangeOfEnumerable

4ms

✔ Indexer_WithIndexOfString

< 1ms

✔ Indexer_WithIndexOfEnumerable

1ms

✔ Length_IsCorrect

< 1ms

✔ StartsWith_IsCorrectWithString

< 1ms

✔ StartsWith_IsCorrectWithEnumerable

1ms

✔ EndsWith_IsCorrectWithString

< 1ms

✔ EndsWith_IsCorrectWithEnumerable

< 1ms

✔ GetEnumerator_Generic_IsCorrect

< 1ms

✔ GetEnumerator_Generic_WorksWithLinq

< 1ms

✔ GetEnumerator_NonGeneric_IsCorrect

< 1ms

✔ ToVirtuallyRotated

5ms

✔ GenerateFullText_IsCorrect (,$,System.String[],System.Char[])

5ms

✔ GenerateFullText_IsCorrect (,1,System.String[],System.Char[])

< 1ms

✔ GenerateFullText_IsCorrect (1,2,System.String[],System.Char[])

1ms

✔ GenerateFullText_IsCorrect (a1a,2,System.String[],System.Char[])

< 1ms

✔ GenerateFullText_IsCorrect (a1b,2,System.String[],System.Char[])

< 1ms

✔ GenerateFullText_IsCorrect (a1b2ab,3,System.String[],System.Char[])

< 1ms

✔ GenerateFullText_IsCorrect (a12ab,3,System.String[],System.Char[])

< 1ms

✔ GenerateFullText_IsCorrect (1a2aa3babaa,4,System.String[],System.Char[])

< 1ms

✔ GenerateFullText_RaiseExceptionOnRepeatedTerminators

< 1ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

3ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsCDF_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

9ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ BuildTerminatorsIndexMap_IsCorrect (System.String[],System.Int32[])

< 1ms

✔ Ctor_Preconditions_WithValidateInput

11ms

✔ Ctor_BrokenInvariant_WithoutValidateInput

< 1ms

✔ TerminatorIndex_IsCorrect

< 1ms

✔ Indexer_WithSelector

< 1ms

✔ Indexer_WithRangeOfString

< 1ms

✔ Indexer_WithRangeOfEnumerable

1ms

✔ Indexer_WithIndexOfString

< 1ms

✔ Indexer_WithIndexOfEnumerable

< 1ms

✔ Length_IsCorrect

< 1ms

✔ StartsWith_IsCorrect

< 1ms

✔ EndsWith_IsCorrect

< 1ms

✔ GetEnumerator_Generic_IsCorrect

< 1ms

✔ GetEnumerator_Generic_WorksWithLinq

< 1ms

✔ GetEnumerator_NonGeneric_IsCorrect

< 1ms

✔ Equals_ByValue

< 1ms

✔ GetHashCode_ByValue

< 1ms

✔ Terminator_IsSet

< 1ms

✔ Compare_IsCorrect_WithNoTerminatorIncluded

< 1ms

✔ Compare_IsCorrect_WithTerminatorIncludedLowerInASCII

< 1ms

✔ Compare_IsCorrect_WithTerminatorIncludedHigherInASCII

< 1ms

✔ GetEnumerator_IteratesCorrectly

< 1ms

✔ GetEnumerator_ResetsCorrectly

< 1ms

✔ GetEnumerator_CurrentRaisesExceptionBeforeAndAfter

< 1ms

✔ GetEnumerator_AsIEnumerable_IteratesCorrectly

< 1ms

✔ GetEnumerator_AsIEnumerable_ResetsCorrectly

< 1ms

✔ Indexer_FollowsRotation

< 1ms

✔ CompareTo_IsCorrect

1ms

✔ PushAndPop_AreInQueueOrder

1ms

✔ Count_IsCorrect

< 1ms

✔ Pop_ThrowsExceptionOnEmptyXifo

< 1ms

✔ PushAndPop_AreCorrect

1ms

✔ PushAndPop_AreInStackOrder

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Pop_ThrowsExceptionOnEmptyXifo

< 1ms

✔ PushAndPop_AreCorrect

< 1ms

✔ Equals_ByValue

< 1ms

✔ GetHashCode_ByValue

< 1ms

✔ Terminator_IsSet

< 1ms

✔ Compare_IsCorrect_WithTerminatorLowerInASCII

< 1ms

✔ Compare_IsCorrect_WithTerminatorHigherInASCII

< 1ms

✔ CountO1_IsCorrectWithEmptyEnumerables

1ms

✔ CountO1_IsCorrectWithSingletons

3ms

✔ CountO1_IsCorrectWithMultipleValues

< 1ms

✔ CountO1_DoesntEnumerateNonGenericIListImplementers

< 1ms

✔ CountO1_DoesntEnumerateGenericIListImplementers

< 1ms

✔ CountO1_EnumeratesGenericEnumerables

< 1ms

✔ ElementAtO1_IsCorrect

5ms

✔ ElementAtO1_ThrowsExceptionForInvalidIndexes

4ms

✔ ElementAtO1_DoesntEnumerateNonGenericIListImplementers

< 1ms

✔ ElementAtO1_DoesntEnumerateGenericIListImplementers

< 1ms

✔ ElementAtO1_EnumeratesGenericEnumerables

5ms

✔ ElementAtO1OrDefault_IsCorrect

1ms

✔ ElementAtO1OrDefault_ThrowsExceptionForNegativeIndexes

< 1ms

✔ ElementAtO1OrDefault_ReturnsDefaultForBigIndexes

< 1ms

✔ ElementAtO1OrDefault_DoesntEnumerateNonGenericIListImplementers

< 1ms

✔ ElementAtO1OrDefault_DoesntEnumerateGenericIListImplementers

< 1ms

✔ ElementAtO1OrDefault_EnumeratesGenericEnumerables

< 1ms

✔ EnumerateExactlyFirst_RaisesExceptionOnInvalidCount

1ms

✔ EnumerateExactlyFirst_RaisesExceptionOnShorterEnumerables

2ms

✔ EnumerateExactlyFirst_EnumeratesFirstNItemsCorrectly

< 1ms

✔ EnumerateExactlyFirst_DoesntEnumerateReminder

< 1ms

✔ EnumerateExactlyFirst_ReminderIsCorrect

< 1ms

✔ EnumerateAtMostFirst_DoesntRaiseExceptionOnShorterEnumerables

1ms

✔ SkipO1_IsCorrectWithGenericLists

1ms

✔ SkipO1_IsCorrectWithStrings

1ms

✔ SkipO1_IsCorrectWithNonGenericLists

< 1ms

✔ SkipO1_IsCorrectWithEnumerables

1ms

✔ AsNodes_ReturnsItemsInOrder

2ms

✔ AsNodes_IsEmptyOnEmptyList

< 1ms

✔ AsNodes_FirstCoincide

< 1ms

✔ AsNode_IntermediateCoincide

< 1ms

✔ AsNodes_LastCoincide

< 1ms

✔ Equals_IsByValue

< 1ms

✔ GetHashCode_IsByValue

< 1ms

✔ Middle_IsCorrect

< 1ms

✔ LongestCommonPrefix_IsCorrect (,,0)

< 1ms

✔ LongestCommonPrefix_IsCorrect (,,0)

< 1ms

✔ LongestCommonPrefix_IsCorrect (a,b,0)

< 1ms

✔ LongestCommonPrefix_IsCorrect (a,,0)

< 1ms

✔ LongestCommonPrefix_IsCorrect (,a,0)

< 1ms

✔ LongestCommonPrefix_IsCorrect (a,a,1)

< 1ms

✔ LongestCommonPrefix_IsCorrect (aa,a,1)

< 1ms

✔ LongestCommonPrefix_IsCorrect (a,aa,1)

< 1ms

✔ LongestCommonPrefix_IsCorrect (aab,aa,2)

< 1ms

✔ LongestCommonPrefix_IsCorrect (aab,aac,2)

< 1ms

✔ LongestCommonPrefix_IsCorrect (aab,aacbaab,2)

< 1ms

✔ LongestCommonPrefix_IsCorrect (aabc,aabaabc,3)

< 1ms

✔ LongestCommonPrefix_RaisesExceptionWithInvalidIndexes

< 1ms

✔ Equals_ByValueOnItemsOfUnderlyingEnumerable

< 1ms

✔ AsValue_WrapsProvidedEnumerableIntoAValueEnumerable

9ms

✔ Ctor_DoesntEnumerateUnderlyingEnumerable

1ms

✔ Ctor_IsIdempotent

< 1ms

✔ Equals_ByValueOnItemsOfUnderlyingEnumerable

< 1ms

✔ GetHashCode_ByValueOnItemsOfUnderlyingEnumerable

< 1ms

✔ ToString_IncludesUnderlyingEnumerableToString

< 1ms

✔ GetEnumerator_WithGeneric_GivesItemsOfUnderlyingEnumerable

5ms

✔ GetEnumerator_WithoutGeneric_GivesItemsOfUnderlyingEnumerable

< 1ms

✔ ToValueReadOnlyCollection_IsCorrect

1ms

✔ ToValueReadOnlyDictionary_IsCorrectWithDictionary

3ms

✔ ToValueReadOnlyDictionary_IsCorrectWithEnumerable

1ms

✔ Ctor_EmbedInputEnumerable

< 1ms

✔ Ctor_IndependenceFromInputEnumerable

< 1ms

✔ Equals_CheckForNull

< 1ms

✔ Equals_CheckType

< 1ms

✔ Equals_IsByValue

< 1ms

✔ Equals_IsSensitiveToTheOrderOfAddition

< 1ms

✔ EqualsOperator_IsByValue

< 1ms

✔ DifferentOperator_IsByValue

< 1ms

✔ GetHashCode_WorksWithEmptyCollection

1ms

✔ GetHashCode_IsByValue_WithPrimitiveType

< 1ms

✔ GetHashCode_IsByValue_WithRecordType

< 1ms

✔ ToString_IncludesToStringOfItems

< 1ms

✔ Ctor_EmbedInputEnumerable

< 1ms

✔ Ctor_IndependenceFromInputEnumerable

< 1ms

✔ Ctor_WithEnumerableOfEntries

< 1ms

✔ Equals_CheckType

< 1ms

✔ Equals_IsByValue

< 1ms

✔ Equals_IsInsensitiveToTheOrderOfAddition

< 1ms

✔ EqualsOperator_IsByValue

< 1ms

✔ DifferentOperator_IsByValue

< 1ms

✔ GetHashCode_WorksWithEmptyDictionary

2ms

✔ GetHashCode_IsByValue_WithPrimitiveType

< 1ms

✔ GetHashCode_IsByValue_WithRecordType

2ms

✔ ToString_IncludesToStringOfKeysAndValues

1ms

✔ Ctor_ValidIndex

< 1ms

✔ CompareTo_IsCorrect

< 1ms

✔ Of_InboundIndexes

< 1ms

✔ Of_OutOfBoundsIndexes

< 1ms

✔ ToString_OfEquivalentInstancesAreTheSame

< 1ms

✔ ToString_WithDifferentStart

< 1ms

✔ Ctor_InvalidArguments

1ms

✔ Equality_IsAlwaysByValue

2ms

✔ Indexer_RetrievesChild

< 1ms

✔ Children_ImmutabilityOnGet

1ms

✔ Children_Immutability_FromCtorParam

< 1ms

✔ ToString_IsTheSameOnEquivalentTrees

10ms

✔ ToString_OnLeafIncludesStart

< 1ms

✔ BuildTree_WithTextWithTerminatorInput

2ms

✔ BuildTree_EmptyString

< 1ms

✔ BuildTree_StringIncludingTerminator

< 1ms

✔ BuildTree_SingleCharString

< 1ms

✔ BuildTree_TwoCharsString_DifferentPrefixes

< 1ms

✔ BuildTree_TwoCharsString_SamePrefixes

< 1ms

✔ BuildTree_ThreeCharsString_SamePrefixes

< 1ms

✔ BuildTree_ThreeCharsString_PartiallySamePrefixes

< 1ms

✔ BuildTree_ThreeCharsString_DifferentPrefixes

< 1ms

✔ BuildTree_ReturnsOnlySuffixes

10ms

✔ BuildTree_ReturnsAllSuffixes

2ms

✔ BuildTree_StartLeftNullAtNonLeafNodes

7ms

✔ BuildTree_StartCorrectlySetAtLeafNodes

3ms

✔ BuildTree_BuildsExampleTrieFromExampleText

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (EmptyStrings)

7ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneNonEmptyOneEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneEmptyOneNonEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmptyDifferentOrder)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoNonSharingChars)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSharingChars)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSame)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeDifferent)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSameOneDifferent)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeSame)

< 1ms

✔ Ctor_ValidIndex

< 1ms

✔ Ctor_ZeroLengthIsValid

< 1ms

✔ CompareTo_IsCorrect

< 1ms

✔ Of_InboundIndexes

< 1ms

✔ Of_OutOfBoundsIndexes

< 1ms

✔ OfRotated_InboundIndexes

< 1ms

✔ OfRotated_OutOfBoundsIndexes

< 1ms

✔ ToString_OfEquivalentInstancesAreTheSame

< 1ms

✔ ToString_WithDifferentStartOrLengthAreDifferent

< 1ms

✔ Ctor_InvalidArguments

1ms

✔ Equality_IsAlwaysByValue

1ms

✔ Indexer_RetrievesChild

< 1ms

✔ Children_Immutability_OnGet

< 1ms

✔ Children_Immutability_FromCtorParam

< 1ms

✔ ToString_IsTheSameOnEquivalentTrees

1ms

✔ ToString_OnLeafIncludesStart

< 1ms

✔ IsEquivalent_IsCorrectWithLeaves

< 1ms

✔ IsEquivalent_IsCorrectWithIntermediateWithSingleCharEdges

2ms

✔ IsEquivalent_IsCorrectWithIntermediateWithMultipleCharsEdges

< 1ms

✔ IsEquivalent_IsCorrectWithIntermediateWithSameChildrenButShuffledEdges

< 1ms

✔ BuildTree_IsCorrectWithSingleText (EmptyString)

12ms

✔ BuildTree_IsCorrectWithSingleText (SingleChar)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoCharsString_DifferentPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoCharsString_SamePrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_SamePrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_PartiallySamePrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_DifferentPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoChars_ExtendingPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeChars_ExtendingPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (Issue75_BreakingUkkonen)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (EmptyStrings)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneNonEmptyOneEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneEmptyOneNonEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmptyDifferentOrder)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoNonSharingChars)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSharingChars)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSame)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeDifferent)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSameOneDifferent)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeSame)

< 1ms

✔ BuildTree_StringIncludingTerminator

< 1ms

✔ BuildTree_ReturnsOnlySuffixes

1ms

✔ BuildTree_ReturnsAllSuffixes

< 1ms

✔ BuildTree_UsesTerminatorForMatchToDistinguishSuffixesFromAnySubstring

6ms

✔ BuildTree_StartLeftNullAtNonLeafNodes

< 1ms

✔ BuildTree_StartCorrectlySetAtLeafNodes

1ms

✔ BuildTree_BuildsExampleTreeFromExampleText

< 1ms

✔ BuildTree_IsCorrectWithSingleText (EmptyString)

10ms

✔ BuildTree_IsCorrectWithSingleText (SingleChar)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoCharsString_DifferentPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoCharsString_SamePrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_SamePrefixes)

1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_PartiallySamePrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_DifferentPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoChars_ExtendingPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeChars_ExtendingPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (Issue75_BreakingUkkonen)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (EmptyStrings)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneNonEmptyOneEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneEmptyOneNonEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmptyDifferentOrder)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoNonSharingChars)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSharingChars)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSame)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeDifferent)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSameOneDifferent)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeSame)

< 1ms

✔ BuildTree_StringIncludingTerminator

< 1ms

✔ BuildTree_ReturnsOnlySuffixes

< 1ms

✔ BuildTree_ReturnsAllSuffixes

< 1ms

✔ BuildTree_UsesTerminatorForMatchToDistinguishSuffixesFromAnySubstring

< 1ms

✔ BuildTree_StartLeftNullAtNonLeafNodes

< 1ms

✔ BuildTree_StartCorrectlySetAtLeafNodes

< 1ms

✔ BuildTree_BuildsExampleTreeFromExampleText

< 1ms

✔ BuildTree_IsCorrectWithSingleText (EmptyString)

10ms

✔ BuildTree_IsCorrectWithSingleText (SingleChar)

1ms

✔ BuildTree_IsCorrectWithSingleText (TwoCharsString_DifferentPrefixes)

< 1ms

✔ BuildTree_IsCorrectWithSingleText (TwoCharsString_SamePrefixes)

2ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_SamePrefixes)

1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_PartiallySamePrefixes)

1ms

✔ BuildTree_IsCorrectWithSingleText (ThreeCharsString_DifferentPrefixes)

1ms

✔ BuildTree_IsCorrectWithSingleText (TwoChars_ExtendingPrefixes)

5ms

✔ BuildTree_IsCorrectWithSingleText (ThreeChars_ExtendingPrefixes)

4ms

✔ BuildTree_IsCorrectWithSingleText (Issue75_BreakingUkkonen)

6ms

✔ BuildTree_IsCorrectWithMultipleTexts (EmptyStrings)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneNonEmptyOneEmpty)

< 1ms

✔ BuildTree_IsCorrectWithMultipleTexts (OneEmptyOneNonEmpty)

1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmpty)

1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoEmptyOneNonEmptyDifferentOrder)

1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoNonSharingChars)

1ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSharingChars)

2ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSame)

3ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeDifferent)

2ms

✔ BuildTree_IsCorrectWithMultipleTexts (TwoSameOneDifferent)

3ms

✔ BuildTree_IsCorrectWithMultipleTexts (ThreeSame)

3ms

✔ BuildTree_StringIncludingTerminator

< 1ms

✔ BuildTree_ReturnsOnlySuffixes

4ms

✔ BuildTree_ReturnsAllSuffixes

4ms

✔ BuildTree_UsesTerminatorForMatchToDistinguishSuffixesFromAnySubstring

1ms

✔ BuildTree_StartLeftNullAtNonLeafNodes

3ms

✔ BuildTree_StartCorrectlySetAtLeafNodes

3ms

✔ BuildTree_BuildsExampleTreeFromExampleText

1ms

✔ Text_IsSetOnConstruction

< 1ms

✔ Root_IsSetOnConstruction

< 1ms

✔ IsThereANextPhase_IsCorrect

< 1ms

✔ StillRemainingSuffixesInCurrentPhase_AccessProtectedWhenNotInPhase

< 1ms

✔ ActivePointFollowedByCurrentChar_NullAtStart

< 1ms

✔ ActivePointFollowedByCurrentChar_ThrowsExceptionBeforeStartingAPhase

< 1ms

✔ InitializeActiveEdgeAndLength_ThrowsExceptionWhenInvalidActivePoint

< 1ms

✔ ActivePointFollowedByCurrentChar_WhenActivePointIsDefined_TrueCases

< 1ms

✔ ActivePointFollowedByCurrentChar_WhenActivePointIsDefined_FalseCases

< 1ms

✔ Equals_BasedOnStartAndEndValue

< 1ms

✔ GetHashCode_DoesntChangeWhenMovingEnd

< 1ms

✔ Match_Preconditions

< 1ms

✔ Match_SuccessAndMatchedCharsIsCorrect

< 1ms

✔ Match_UnsuccessAndMatchedCharsIsCorrect

< 1ms

✔ Match_SuccessBeginAndPathIsCorrect

1ms

✔ BuildTree_UsesTerminatorForMatchToDistinguishSuffixesFromAnySubstring

< 1ms

✔ Find_IsCorrect (A,B,System.String[])

30ms

✔ Find_IsCorrect (A,A,System.String[])

< 1ms

✔ Find_IsCorrect (AB,BA,System.String[])

< 1ms

✔ Find_IsCorrect (AB,BBA,System.String[])

< 1ms

✔ Find_IsCorrect (AB,BBAA,System.String[])

< 1ms

✔ Find_IsCorrect (ABAB,BBAA,System.String[])

< 1ms

✔ Find_IsCorrect (BXAA,AXBB,System.String[])

< 1ms

✔ Find_IsCorrect (BXZA,AYBB,System.String[])

< 1ms

✔ Find_IsCorrect (BXAA,BXAA,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,AABBAAB,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,ABBAAB,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,BBAAB,System.String[])

< 1ms

✔ Find_IsCorrect (BBAAA,BBAA,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,BBAA,System.String[])

< 1ms

✔ Ctor_RaiseExceptionWhenTerminatorsAreEqual

< 1ms

✔ Find_RaiseExceptionWhenAnyTerminatorIsInAnyText

3ms

✔ Find_IsCorrect (A,B,System.String[])

54ms

✔ Find_IsCorrect (A,A,System.String[])

10ms

✔ Find_IsCorrect (AB,BA,System.String[])

2ms

✔ Find_IsCorrect (AB,BBA,System.String[])

5ms

✔ Find_IsCorrect (AB,BBAA,System.String[])

6ms

✔ Find_IsCorrect (ABAB,BBAA,System.String[])

4ms

✔ Find_IsCorrect (BXAA,AXBB,System.String[])

6ms

✔ Find_IsCorrect (BXZA,AYBB,System.String[])

5ms

✔ Find_IsCorrect (BXAA,BXAA,System.String[])

6ms

✔ Find_IsCorrect (AABBA,AABBAAB,System.String[])

11ms

✔ Find_IsCorrect (AABBA,ABBAAB,System.String[])

8ms

✔ Find_IsCorrect (AABBA,BBAAB,System.String[])

8ms

✔ Find_IsCorrect (BBAAA,BBAA,System.String[])

5ms

✔ Find_IsCorrect (AABBA,BBAA,System.String[])

8ms

✔ Ctor_RaiseExceptionWhenTerminatorsAreEqual

< 1ms

✔ Find_RaiseExceptionWhenAnyTerminatorIsInAnyText

1ms

✔ Find_IsCorrect (A,B,System.String[])

7ms

✔ Find_IsCorrect (A,A,System.String[])

< 1ms

✔ Find_IsCorrect (AB,BA,System.String[])

< 1ms

✔ Find_IsCorrect (AB,BBA,System.String[])

5ms

✔ Find_IsCorrect (AB,BBAA,System.String[])

< 1ms

✔ Find_IsCorrect (ABAB,BBAA,System.String[])

< 1ms

✔ Find_IsCorrect (BXAA,AXBB,System.String[])

< 1ms

✔ Find_IsCorrect (BXZA,AYBB,System.String[])

< 1ms

✔ Find_IsCorrect (BXAA,BXAA,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,AABBAAB,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,ABBAAB,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,BBAAB,System.String[])

< 1ms

✔ Find_IsCorrect (BBAAA,BBAA,System.String[])

< 1ms

✔ Find_IsCorrect (AABBA,BBAA,System.String[])

10ms

✔ FlagsConsistency

< 1ms

✔ BuildTree_CallsTheBuilderWithAnEquivalentTextWithTerminator

1ms

✔ IsAdjacentTo_IsCorrect

< 1ms

✔ ContainsIndex_ThrowsExceptionOnInvalidIndex

< 1ms

✔ ContainsIndex_IsCorrect

< 1ms

✔ ContainsIndexesNonBiggerThan_ThrowsExceptionOnInvalidIndex

< 1ms

✔ ContainsIndexesNonBiggerThan_IsCorrect

< 1ms

✔ GetAllSuffixesFor_IsCorrectWithTries

1ms

✔ GetAllSuffixesFor_IsCorrectWithTrees

< 1ms

✔ SuffixFor_IsCorrectForNonEmptyPathOnSuffixTree

< 1ms

✔ SuffixFor_IsCorrectForNonEmptyPathOnSuffixTrie

< 1ms

✔ SuffixFor_IsCorrectForEmptyPath

< 1ms

✔ IsSuffixOf_IsCorrectForNonEmtpyPath

< 1ms

✔ IsSuffixOf_IsTrueForEmtpyPath

< 1ms

✔ ContainsIndex_ThrowsExceptionOnInvalidIndex

< 1ms

✔ ContainsIndex_IsAlwaysFalseOnAEmptyPath

< 1ms

✔ ContainsIndex_IsCorrect

9ms

✔ ContainsIndexesNonBiggerThan_ThrowsExceptionOnInvalidIndex

< 1ms

✔ ContainsIndexesNonBiggerThan_IsAlwaysFalseOnAEmptyPath

< 1ms

✔ ContainsIndexesNonBiggerThan_IsCorrect

< 1ms

✔ TrieToTree_DoesntStackOverflowWithDeepStructures

244ms

✔ TreeToTrie_IsCorrect (Leaf)

11ms

✔ TreeToTrie_IsCorrect (Example)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeSingleChainSingleLeafToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeSingleChainTwoLeafsToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeToFourLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeToTwoLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeWithSiblingToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (ThreeLevelsTreeToFourLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (ThreeLevelsTreeToSixLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (OneLevelTreeToMostUnbalancedTenLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (OneLevelTreeToMostUnbalancedAHundredLevelsTrie)

< 1ms

✔ TreeToTrie_OnlySupportsLeafAndIntermediateNodes_AsArgument

< 1ms

✔ TreeToTrie_OnlySupportsLeafAndIntermediateNodes_DeepInTheStructure

< 1ms

✔ TrieToTree_IsCorrect (Leaf)

< 1ms

✔ TrieToTree_IsCorrect (Example)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeSingleChainSingleLeafToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeSingleChainTwoLeafsToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeToFourLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeToTwoLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeWithSiblingToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (ThreeLevelsTreeToFourLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (ThreeLevelsTreeToSixLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (OneLevelTreeToMostUnbalancedTenLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (OneLevelTreeToMostUnbalancedAHundredLevelsTrie)

< 1ms

✔ TrieToTree_OnlySupportsLeafAndIntermediateNodes_AsArgument

< 1ms

✔ TrieToTree_OnlySupportsLeafAndIntermediateNodes_DeepInTheStructure

< 1ms

✔ TreeToTrie_IsCorrect (Leaf)

< 1ms

✔ TreeToTrie_IsCorrect (Example)

1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeSingleChainSingleLeafToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeSingleChainTwoLeafsToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeToFourLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeToTwoLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeWithSiblingToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (ThreeLevelsTreeToFourLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (ThreeLevelsTreeToSixLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (OneLevelTreeToMostUnbalancedTenLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (OneLevelTreeToMostUnbalancedAHundredLevelsTrie)

< 1ms

✔ TreeToTrie_OnlySupportsLeafAndIntermediateNodes_AsArgument

< 1ms

✔ TreeToTrie_OnlySupportsLeafAndIntermediateNodes_DeepInTheStructure

< 1ms

✔ TrieToTree_IsCorrect (Leaf)

< 1ms

✔ TrieToTree_IsCorrect (Example)

2ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeSingleChainSingleLeafToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeSingleChainTwoLeafsToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeToFourLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeToTwoLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeWithSiblingToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (ThreeLevelsTreeToFourLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (ThreeLevelsTreeToSixLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (OneLevelTreeToMostUnbalancedTenLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (OneLevelTreeToMostUnbalancedAHundredLevelsTrie)

< 1ms

✔ TrieToTree_OnlySupportsLeafAndIntermediateNodes_AsArgument

< 1ms

✔ TrieToTree_OnlySupportsLeafAndIntermediateNodes_DeepInTheStructure

< 1ms

✔ TreeToTrie_IsCorrect (Leaf)

< 1ms

✔ TreeToTrie_IsCorrect (Example)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeSingleChainSingleLeafToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeSingleChainTwoLeafsToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeToFourLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeToTwoLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (TwoLevelsTreeWithSiblingToThreeLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (ThreeLevelsTreeToFourLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (ThreeLevelsTreeToSixLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (OneLevelTreeToMostUnbalancedTenLevelsTrie)

< 1ms

✔ TreeToTrie_IsCorrect (OneLevelTreeToMostUnbalancedAHundredLevelsTrie)

< 1ms

✔ TreeToTrie_OnlySupportsLeafAndIntermediateNodes_AsArgument

< 1ms

✔ TreeToTrie_OnlySupportsLeafAndIntermediateNodes_DeepInTheStructure

< 1ms

✔ TrieToTree_IsCorrect (Leaf)

< 1ms

✔ TrieToTree_IsCorrect (Example)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeSingleChainSingleLeafToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeSingleChainTwoLeafsToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeToFourLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeToTwoLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (TwoLevelsTreeWithSiblingToThreeLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (ThreeLevelsTreeToFourLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (ThreeLevelsTreeToSixLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (OneLevelTreeToMostUnbalancedTenLevelsTrie)

< 1ms

✔ TrieToTree_IsCorrect (OneLevelTreeToMostUnbalancedAHundredLevelsTrie)

< 1ms

✔ TrieToTree_OnlySupportsLeafAndIntermediateNodes_AsArgument

< 1ms

✔ TrieToTree_OnlySupportsLeafAndIntermediateNodes_DeepInTheStructure

< 1ms

✔ Build_IsCorrect (,System.Int32[],System.Int32[])

1ms

✔ Build_IsCorrect (a,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (aa,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (aba,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (abc,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (,System.Int32[],System.Int32[])

9ms

✔ Build_IsCorrect (a,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (aa,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (aba,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (abc,System.Int32[],System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[],System.Int32[])

< 1ms

✔ Ctor_RaisesExceptionWhenPcsLengthIsInvalid

< 1ms

✔ Ctor_RaisesExceptionWhenOrderAndEqClassesAreIncoherent

< 1ms

✔ Sort_IsCorrect (ab,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (aba,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,3,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abcd,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccba,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccba,3,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (ab,1,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (aba,1,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abcd,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccbb,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccbb,3,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Ctor_RaisesExceptionWhenPcsLengthIsNotCoherentWithEqClassesPcsHalfLength

< 1ms

✔ Ctor_RaisesExceptionWhenOrderIsNotCoherentWithEqClassesPcsHalfLength

< 1ms

✔ Ctor_RaisesExceptionWhenPcsLengthIsNotEven

< 1ms

✔ Classify_IsCorrect (ab,2,System.Int32[],System.Int32[],False,System.Int32[])

1ms

✔ Classify_IsCorrect (aab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ab,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aab,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,6,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,6,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,6,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,6,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Ctor_RaisesExceptionWithInvalidPcsLength

1ms

✔ Classify_IsCorrect (ab,2,System.Int32[],System.Int32[],False,System.Int32[])

12ms

✔ Classify_IsCorrect (aab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ab,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aab,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,6,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,6,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,6,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,6,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Ctor_RaisesExceptionWhenPcsLengthIsInvalid

1ms

✔ Sort_IsCorrect (ab,1,System.Int32[],System.Int32[],False,System.Int32[])

18ms

✔ Sort_IsCorrect (aba,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,3,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abcd,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccba,1,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccba,3,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Sort_IsCorrect (ab,1,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (aba,1,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abba,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (abcd,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccbb,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Sort_IsCorrect (cabccbb,3,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (,False,System.Int32[])

11ms

✔ Classify_IsCorrect (a,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aa,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (cabab,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ccaebfaeeb,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (a,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aa,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (cabab,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ccaebfaeeb,True,System.Int32[])

< 1ms

✔ Ctor_RaisesExceptionWhenPcsLengthIsNotCoherentWithInput

1ms

✔ Ctor_RaisesExceptionWhenOrderIsNotCoherentWithInput

4ms

✔ Classify_IsCorrect (ab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,2,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ab,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aab,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,2,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,4,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abaa,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abac,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,4,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,6,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,6,System.Int32[],System.Int32[],False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (abacbba,6,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (babbaab,6,System.Int32[],System.Int32[],True,System.Int32[])

< 1ms

✔ Ctor_RaisesExceptionWhenInputAndOrderHaveDifferentLength

1ms

✔ Classify_IsCorrect (,False,System.Int32[])

14ms

✔ Classify_IsCorrect (a,False,System.Int32[])

5ms

✔ Classify_IsCorrect (aa,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (cabab,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ccaebfaeeb,False,System.Int32[])

< 1ms

✔ Classify_IsCorrect (a,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aa,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (aba,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (cabab,True,System.Int32[])

< 1ms

✔ Classify_IsCorrect (ccaebfaeeb,True,System.Int32[])

< 1ms

✔ Build_IsCorrect (,System.Int32[])

1ms

✔ Build_IsCorrect (ab,System.Int32[])

< 1ms

✔ Build_IsCorrect (ba,System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[])

< 1ms

✔ Build_IsCorrect (ababcacaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (aabaacaaadba,System.Int32[])

< 1ms

✔ Build_IsCorrect (,System.Int32[])

6ms

✔ Build_IsCorrect (ab,System.Int32[])

< 1ms

✔ Build_IsCorrect (ba,System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[])

< 1ms

✔ Build_IsCorrect (ababcacaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (aabaacaaadba,System.Int32[])

< 1ms

✔ Build_IsCorrect (,System.Int32[])

< 1ms

✔ Build_IsCorrect (ab,System.Int32[])

< 1ms

✔ Build_IsCorrect (ba,System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[])

< 1ms

✔ Build_IsCorrect (ababcacaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (aabaacaaadba,System.Int32[])

< 1ms

✔ Build_IsCorrect (,System.Int32[])

15ms

✔ Build_IsCorrect (ab,System.Int32[])

< 1ms

✔ Build_IsCorrect (ba,System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[])

< 1ms

✔ Build_IsCorrect (ababcacaa,System.Int32[])

3ms

✔ Build_IsCorrect (aabaacaaadba,System.Int32[])

1ms

✔ Build_IsCorrect (,System.Int32[])

< 1ms

✔ Build_IsCorrect (ab,System.Int32[])

< 1ms

✔ Build_IsCorrect (ba,System.Int32[])

< 1ms

✔ Build_IsCorrect (aaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (abaabaac,System.Int32[])

< 1ms

✔ Build_IsCorrect (ababcacaa,System.Int32[])

< 1ms

✔ Build_IsCorrect (aabaacaaadba,System.Int32[])

< 1ms

✔ Sort_IsCorrect (,)

6ms

✔ Sort_IsCorrect (a,)

< 1ms

✔ Sort_IsCorrect (aa,)

< 1ms

✔ Sort_IsCorrect (ab,)

< 1ms

✔ Sort_IsCorrect (aba,)

< 1ms

✔ Sort_IsCorrect (abab,)

< 1ms

✔ Sort_IsCorrect (cabcba,)

< 1ms

✔ Sort_IsCorrect (dceadfddbecdedaefbcecfghdd,)

< 1ms

✔ Sort_IsCorrect (,)

< 1ms

✔ Sort_IsCorrect (a,)

< 1ms

✔ Sort_IsCorrect (aa,)

< 1ms

✔ Sort_IsCorrect (ab,)

< 1ms

✔ Sort_IsCorrect (aba,)

< 1ms

✔ Sort_IsCorrect (abab,)

< 1ms

✔ Sort_IsCorrect (cabcba,)

< 1ms

✔ Sort_IsCorrect (dceadfddbecdedaefbcecfghdd,)

< 1ms

✔ Ctor_RaisesExceptionOnInvalidParams

1ms

✔ Ctor_SetsTheIncreasingFactor

< 1ms

✔ Push_ResizesEnoughEvenWithLowIncreasingFactor

< 1ms

✔ Ctor_CreatesAnEmptyStack

< 1ms

✔ Peek_RaisesExceptionOnEmptyStack

< 1ms

✔ Peek_ReturnsTheLastPushedItem

< 1ms

✔ Peek_DoesntAlterTheStack

< 1ms

✔ Pop_RaisesExceptionOnEmptyStack

< 1ms

✔ PushAndPop_AreCorrect

3ms

✔ Ctor_CreatesAnEmptyStack

< 1ms

✔ Peek_RaisesExceptionOnEmptyStack

< 1ms

✔ Peek_ReturnsTheLastPushedItem

< 1ms

✔ Peek_DoesntAlterTheStack

< 1ms

✔ Pop_RaisesExceptionOnEmptyStack

< 1ms

✔ PushAndPop_AreCorrect

< 1ms

✔ IsLeaf_IsCorrectForSuffixTree

< 1ms

✔ IsLeaf_IsCorrectForSuffixTrie

< 1ms

✔ Concat_IsCorrectPrependingEmptyPath

3ms

✔ Concat_IsCorrectAppendingEmptyPath

< 1ms

✔ Concat_IsCorrectWithTwoNonEmptyPaths

< 1ms

✔ Append_IsCorrect

< 1ms

✔ Ctor_OfSuffixTree_EmptyPath_IsCorrect

< 1ms

✔ Ctor_OfSuffixTree_SingletonPath_IsCorrect

< 1ms

✔ Ctor_OfSuffixTree_MultistepPath_IsCorrectWithParams

< 1ms

✔ Ctor_OfSuffixTree_MultistepPath_IsCorrectWithEnumerable

< 1ms

✔ Ctor_OfSuffixTrie_EmptyPath_IsCorrect

< 1ms

✔ Ctor_OfSuffixTrie_SingletonPath_IsCorrect

< 1ms

✔ Ctor_OfSuffixTrie_MultistepPath_IsCorrectWithParams

< 1ms

✔ Ctor_OfSuffixTrie_MultistepPath_IsCorrectWithEnumerable

< 1ms

✔ Equals_ByValue

1ms

✔ Equals_TakesIntoAccountPathNodesOrder

< 1ms

✔ GetHashCode_ByValue

1ms

✔ PathNodes_OfSuffixTree_ImmutabilityOnGet

< 1ms

✔ PathNodes_OfSuffixTree_ImmutabilityOnCtorParam

< 1ms

✔ PathNodes_OfSuffixTrie_ImmutabilityOnGet

< 1ms

✔ PathNodes_OfSuffixTrie_ImmutabilityOnCtorParam

< 1ms

✔ ToString_IsTheSameOnEquivalentPaths

1ms

✔ ToString_OfPathContainsToStringOfSubPath

< 1ms

✔ ToString_OfEmptyPathIsEmptyString

< 1ms

✔ ToString_OfNonEmptyPathIsNonEmptyString

< 1ms

✔ Visit_DoesntOverflowWithDeepStructures

11ms

✔ Visit_DocExamples_ParentFirst

10ms

✔ Visit_DocExamples_ChildrenFirst

2ms

✔ Visit_TraversalOrderParentFirst

< 1ms

✔ Visit_TraversalOrderChildrenFirst

< 1ms

✔ Visit_TraversalOrderNotSupported_OnSingleton

1ms

✔ Visit_TraversalOrderNotSupported_OnTreeWithMultipleNodes

< 1ms

✔ Visit_ChildrenSorter_IsApplied

< 1ms

✔ Visit_TraversalOrderParentFirst_MultiLevelsBacktrackTree

< 1ms

✔ Visit_TraversalOrderChildrenFirst_MultiLevelsBacktrackTree

< 1ms

✔ Visit_ParentIsCorrect

1ms

✔ Visit_IncomingEdgeIsCorrect

< 1ms

✔ Visit_LevelIsCorrect

2ms

✔ Visit_DoesntOverflowWithDeepStructures

30ms

✔ Visit_DocExamples_ParentFirst

1ms

✔ Visit_DocExamples_ChildrenFirst

< 1ms

✔ Visit_TraversalOrderParentFirst

< 1ms

✔ Visit_TraversalOrderChildrenFirst

< 1ms

✔ Visit_TraversalOrderNotSupported_OnSingleton

< 1ms

✔ Visit_TraversalOrderNotSupported_OnTreeWithMultipleNodes

< 1ms

✔ Visit_ChildrenSorter_IsApplied

< 1ms

✔ Visit_MultiLevelsBacktrackTree

< 1ms

✔ Visit_ParentIsCorrect

< 1ms

✔ Visit_IncomingEdgeIsCorrect

< 1ms

✔ Visit_LevelIsCorrect

< 1ms

✔ Visit_DoesntStackOverflowWithNotSoDeepStructures

1ms

✔ Visit_DocExamples_ParentFirst

2ms

✔ Visit_DocExamples_ChildrenFirst

< 1ms

✔ Visit_TraversalOrderParentFirst

< 1ms

✔ Visit_TraversalOrderChildrenFirst

< 1ms

✔ Visit_TraversalOrderNotSupported_OnSingleton

< 1ms

✔ Visit_TraversalOrderNotSupported_OnTreeWithMultipleNodes

< 1ms

✔ Visit_ChildrenSorter_IsApplied

< 1ms

✔ Visit_TraversalOrderParentFirst_MultiLevelsBacktrackTree

< 1ms

✔ Visit_TraversalOrderChildrenFirst_MultiLevelsBacktrackTree

< 1ms

✔ Visit_ParentIsCorrect

< 1ms

✔ Visit_IncomingEdgeIsCorrect

< 1ms

✔ Visit_LevelIsCorrect

< 1ms

✔ Visit_DoesntStackOverflowWithNotSoDeepStructures

< 1ms

✔ Visit_DocExamples_ParentFirst

< 1ms

✔ Visit_DocExamples_ChildrenFirst

< 1ms

✔ Visit_TraversalOrderParentFirst

< 1ms

✔ Visit_TraversalOrderChildrenFirst

< 1ms

✔ Visit_TraversalOrderNotSupported_OnSingleton

< 1ms

✔ Visit_TraversalOrderNotSupported_OnTreeWithMultipleNodes

< 1ms

✔ Visit_ChildrenSorter_IsApplied

< 1ms

✔ Visit_MultiLevelsBacktrackTree

< 1ms

✔ Visit_ParentIsCorrect

< 1ms

✔ Visit_IncomingEdgeIsCorrect

< 1ms

✔ Visit_LevelIsCorrect

< 1ms

✔ GetAllNodeToLeafPaths__DocExample

2ms

✔ GetAllNodeToLeafPaths_IsCorrectWithTries

2ms

✔ GetAllNodeToLeafPaths_IsCorrectWithTrees

1ms

✔ GetAllNodeToLeafPaths__DocExample

2ms

✔ GetAllNodeToLeafPaths_IsCorrectWithTries

< 1ms

✔ GetAllNodeToLeafPaths_IsCorrectWithTrees

< 1ms

✔ Stringify_DoesntStackOverflowWithDeepStructures

3s 38ms

✔ StopIndentingLevel_StopsIndentingWhenReached_WithZero

1ms

✔ StopIndentingLevel_StopsIndentingWhenReached_WithOne

< 1ms

✔ StopIndentingLevel_StopsIndentingWhenReached_WithTwo

< 1ms

✔ PrependLevelAfterStopIndenting_RendersLevelWhenStopIndentingLevelIsReached

< 1ms

✔ Stringify_OfLeaf

< 1ms

✔ Stringify_OfTwoLevelsTree

< 1ms

✔ Stringify_OfThreeLevelsTree

< 1ms

✔ Stringify_OfFourLevelsTree

< 1ms

✔ Stringify_OfEmptyPath

< 1ms

✔ Stringify_OfSingletonPath

< 1ms

✔ Stringify_OfMultistepPath

1ms

✔ Stringify_DoesntStackOverflowWithNotSoDeepStructures

3ms

✔ CustomNewLine_IsReflectedIntoOutput

< 1ms

✔ CustomIndent_IsReflectedIntoOutput

< 1ms

✔ Stringify_OfLeaf

< 1ms

✔ Stringify_OfTwoLevelsTree

< 1ms

✔ Stringify_OfThreeLevelsTree

< 1ms

✔ Stringify_OfFourLevelsTree

< 1ms

✔ Stringify_OfEmptyPath

1ms

✔ Stringify_OfSingletonPath

< 1ms

✔ Stringify_OfMultistepPath

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

1ms

✔ Dequeue_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Count_IsCorrect

1ms

✔ EnqueueAndDequeue_AreCorrect

3ms

✔ EnqueueAndDequeue_WorkWhenExecutedInBursts

2ms

✔ Peek_RaisesExceptionOnEmptyQueue

1ms

✔ Dequeue_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Count_IsCorrect

1ms

✔ EnqueueAndDequeue_AreCorrect

1ms

✔ EnqueueAndDequeue_WorkWhenExecutedInBursts

1ms

✔ CompareTo_IsCorrect

< 1ms

✔ CompareTo_TakesIntoAccountEras

< 1ms

✔ Ctor_WithEnumerable

9ms

✔ Ctor_WithProvidedLinkedList

1ms

✔ Pop_RaisesExceptionOnEmptyQueue

< 1ms

✔ Pop_RespectsPriorities

1ms

✔ PushAndPop_WorkWithReferenceTypes

7ms

✔ PushAndPop_WorkWithValueTypes

6ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

47ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

< 1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ GetPrioritiesOf_FirstIsCorrect

2ms

✔ GetPrioritiesOf_IsCorrect

< 1ms

✔ UpdatePriority_RaisesExceptionOnItemNonPresent

1ms

✔ UpdatePriority_IsStableWithInt

< 1ms

✔ UpdatePriority_IsStableWithReferenceTypes

1ms

✔ UpdatePriority_IsCorrect

< 1ms

✔ UpdatePriority_AllPermutations

< 1ms

✔ UpdatePriority_LongChainOfUpdates (System.Int32[],System.Int32[],System.Int32[])

3ms

✔ UpdatePriority_StalePushTimestamps

< 1ms

✔ UpdatePriority_WorksWhenNewPriorityIsTheSame

< 1ms

✔ Remove_IsCorrect

< 1ms

✔ Remove_WorksWithReferenceTypes

1ms

✔ Remove_WorksWithValueTypes

1ms

✔ PeekKth_ThrowsExceptionOnInvalidK

< 1ms

✔ PeekKth_IsCorrect

< 1ms

✔ PeekKth_IsStable

< 1ms

✔ Merge_QueueUpdatesKeepWorkingOnSourceAfter

1ms

✔ Merge_QueueUpdatesKeepWorkingOnTargetAfter

< 1ms

✔ Clear_QueueUpdatesKeepWorkingAfter

< 1ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

3ms

✔ Merge_WorksWithManyItems

126ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

3ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

4ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

4ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

1ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

6ms

✔ Pop_RaisesExceptionOnEmptyQueue

4ms

✔ Pop_RespectsPriorities

1ms

✔ PushAndPop_WorkWithReferenceTypes

4ms

✔ PushAndPop_WorkWithValueTypes

3ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

12ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

2ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ Merge_WithEmptySource

1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

2ms

✔ Merge_WorksWithManyItems

28ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

1ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ Pop_RaisesExceptionOnEmptyQueue

2ms

✔ Pop_RespectsPriorities

< 1ms

✔ PushAndPop_WorkWithReferenceTypes

1ms

✔ PushAndPop_WorkWithValueTypes

4ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

14ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

< 1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ UpdatePriority_TriggersAChainOfLosers

5ms

✔ GetPrioritiesOf_FirstIsCorrect

2ms

✔ GetPrioritiesOf_IsCorrect

< 1ms

✔ UpdatePriority_RaisesExceptionOnItemNonPresent

< 1ms

✔ UpdatePriority_IsStableWithInt

< 1ms

✔ UpdatePriority_IsStableWithReferenceTypes

1ms

✔ UpdatePriority_IsCorrect

< 1ms

✔ UpdatePriority_AllPermutations

< 1ms

✔ UpdatePriority_LongChainOfUpdates (System.Int32[],System.Int32[],System.Int32[])

1ms

✔ UpdatePriority_StalePushTimestamps

< 1ms

✔ UpdatePriority_WorksWhenNewPriorityIsTheSame

< 1ms

✔ Remove_IsCorrect

< 1ms

✔ Remove_WorksWithReferenceTypes

< 1ms

✔ Remove_WorksWithValueTypes

2ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

6ms

✔ Merge_WorksWithManyItems

30ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

1ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ PushOrUpdate_IsCorrect

7ms

✔ PopAll_ExtractsAllItems

< 1ms

✔ PushOrUpdate_IsCorrect

7ms

✔ PopAll_ExtractsAllItems

< 1ms

✔ Pop_RaisesExceptionOnEmptyQueue

< 1ms

✔ Pop_RespectsPriorities

< 1ms

✔ PushAndPop_WorkWithReferenceTypes

< 1ms

✔ PushAndPop_WorkWithValueTypes

< 1ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

14ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

2ms

✔ Merge_WorksWithManyItems

37ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

1ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ Clear_WipesContentOut

3ms

✔ IsInAHeap_IsTrueWhenARoot

< 1ms

✔ IsInAHeap_IsTrueWhenAChild

< 1ms

✔ AddChild_ThrowsExceptionIfNodeIsARoot

< 1ms

✔ AddChild_ThrowsExceptionIfNodeIsChildOfAnotherNode

< 1ms

✔ AddChild_ThrowsExceptionIfNodeIsAlreadyChildOfTheParent

< 1ms

✔ AddChild_ThrowsExceptionIfNodeParentPropertiesAreIncoherent

< 1ms

✔ AddChild_AddsToTheChildrenOfTheParentAndSetBackreferences

< 1ms

✔ DetachFromParent_ThrowsExceptionOnOrphan

< 1ms

✔ DetachFromParent_ThrowsExceptionWhenParentPropertiesAreIncoherent

< 1ms

✔ DetachFromParent_ThrowsExceptionIfNodeIsARoot

< 1ms

✔ DetachFromParent_UpdatesParentChildren

< 1ms

✔ DetachFromParent_UpdateParentPropertiesOnChild

< 1ms

✔ DeepCopy_PointsToSamePrioritizedItem

1ms

✔ DeepCopy_WorksWithLeaves

< 1ms

✔ DeepCopy_PreservesParentChildStructure

< 1ms

✔ DeepCopy_PreservesParentChildStructureAtMultipleLevels

< 1ms

✔ ToString_IncludesPrioritizedItem

1ms

✔ ToString_IncludesIsInHeap

< 1ms

✔ ToString_IncludesIsALoser

< 1ms

✔ Pop_RaisesExceptionOnEmptyQueue

< 1ms

✔ Pop_RespectsPriorities

< 1ms

✔ PushAndPop_WorkWithReferenceTypes

< 1ms

✔ PushAndPop_WorkWithValueTypes

< 1ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

16ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

< 1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ GetPrioritiesOf_FirstIsCorrect

< 1ms

✔ GetPrioritiesOf_IsCorrect

< 1ms

✔ UpdatePriority_RaisesExceptionOnItemNonPresent

< 1ms

✔ UpdatePriority_IsStableWithInt

2ms

✔ UpdatePriority_IsStableWithReferenceTypes

3ms

✔ UpdatePriority_IsCorrect

< 1ms

✔ UpdatePriority_AllPermutations

< 1ms

✔ UpdatePriority_LongChainOfUpdates (System.Int32[],System.Int32[],System.Int32[])

1ms

✔ UpdatePriority_StalePushTimestamps

< 1ms

✔ UpdatePriority_WorksWhenNewPriorityIsTheSame

< 1ms

✔ Remove_IsCorrect

< 1ms

✔ Remove_WorksWithReferenceTypes

< 1ms

✔ Remove_WorksWithValueTypes

1ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

3ms

✔ Merge_WorksWithManyItems

39ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

2ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ Ctor_EnforcesHeapCountToBeAtMostListCount

1ms

✔ Ctor_EnforcesIndexDeltaToBeAtMostListCount

< 1ms

✔ Ctor_RestoresHeapPropertyWithSpecifiedComparer

3ms

✔ Ctor_WorksOnEmptyHeap

< 1ms

✔ Ctor_DoesntTouchItemsInBufferArea

< 1ms

✔ RaiseEvents_AreInvoked

1ms

✔ HeapCount_IsInstantiatedToTheSpecifiedValue

< 1ms

✔ HeapCount_IsUpdatedOnPushAndPop

1ms

✔ HeapCount_IsIncreasedWhenPushMakesRoomInTheList

< 1ms

✔ HeapCount_IsNotChangedByPeekOrPeekKth

6ms

✔ Push_BeyondListCountUpdatesListCount_WhenHeapAtTheBeginning

< 1ms

✔ Push_BeyondListCountRaisesException_WhenHeapAtTheEnd

< 1ms

✔ Pop_DoesntLoseItems

1ms

✔ Clear_WipesAllItemsOutWithNonReadOnlyLists

< 1ms

✔ Clear_JustResetsHeapCountWithReadOnlyLists

< 1ms

✔ Index_AccessItemsFromHeapAndBuffer

< 1ms

✔ GetEnumerator_EnumeratesItemsFromHeapAndBuffer

< 1ms

✔ Ctor_EnforcesHeapCountToBeAtMostListCount

< 1ms

✔ Ctor_EnforcesIndexDeltaToBeAtMostListCount

< 1ms

✔ Ctor_RestoresHeapPropertyWithSpecifiedComparer

< 1ms

✔ Ctor_WorksOnEmptyHeap

< 1ms

✔ Ctor_DoesntTouchItemsInBufferArea

< 1ms

✔ RaiseEvents_AreInvoked

< 1ms

✔ HeapCount_IsInstantiatedToTheSpecifiedValue

< 1ms

✔ HeapCount_IsUpdatedOnPushAndPop

< 1ms

✔ HeapCount_IsIncreasedWhenPushMakesRoomInTheList

< 1ms

✔ HeapCount_IsNotChangedByPeekOrPeekKth

< 1ms

✔ Push_BeyondListCountUpdatesListCount_WhenHeapAtTheBeginning

< 1ms

✔ Push_BeyondListCountRaisesException_WhenHeapAtTheEnd

< 1ms

✔ Pop_DoesntLoseItems

< 1ms

✔ Clear_WipesAllItemsOutWithNonReadOnlyLists

< 1ms

✔ Clear_JustResetsHeapCountWithReadOnlyLists

< 1ms

✔ Index_AccessItemsFromHeapAndBuffer

< 1ms

✔ GetEnumerator_EnumeratesItemsFromHeapAndBuffer

< 1ms

✔ IndexDelta_IsTakenIntoAccountWhenHeapAtTheBeginning

3ms

✔ IndexDelta_IsTakenIntoAccountWhenHeapAtTheEnd

3ms

✔ Pop_RaisesExceptionOnEmptyQueue

< 1ms

✔ Pop_RespectsPriorities

< 1ms

✔ PushAndPop_WorkWithReferenceTypes

5ms

✔ PushAndPop_WorkWithValueTypes

4ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

9ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ PeekKth_ThrowsExceptionOnInvalidK

1ms

✔ PeekKth_IsCorrect

4ms

✔ PeekKth_IsStable

< 1ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

1ms

✔ Merge_WorksWithManyItems

27ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

1ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ Pop_RaisesExceptionOnEmptyQueue

< 1ms

✔ Pop_RespectsPriorities

< 1ms

✔ PushAndPop_WorkWithReferenceTypes

1ms

✔ PushAndPop_WorkWithValueTypes

1ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

13ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

< 1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ GetPrioritiesOf_FirstIsCorrect

2ms

✔ GetPrioritiesOf_IsCorrect

< 1ms

✔ UpdatePriority_RaisesExceptionOnItemNonPresent

< 1ms

✔ UpdatePriority_IsStableWithInt

< 1ms

✔ UpdatePriority_IsStableWithReferenceTypes

1ms

✔ UpdatePriority_IsCorrect

< 1ms

✔ UpdatePriority_AllPermutations

< 1ms

✔ UpdatePriority_LongChainOfUpdates (System.Int32[],System.Int32[],System.Int32[])

1ms

✔ UpdatePriority_StalePushTimestamps

< 1ms

✔ UpdatePriority_WorksWhenNewPriorityIsTheSame

< 1ms

✔ Remove_IsCorrect

< 1ms

✔ Remove_WorksWithReferenceTypes

< 1ms

✔ Remove_WorksWithValueTypes

< 1ms

✔ Merge_QueueUpdatesKeepWorkingOnSourceAfter

< 1ms

✔ Merge_QueueUpdatesKeepWorkingOnTargetAfter

< 1ms

✔ Clear_QueueUpdatesKeepWorkingAfter

< 1ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

2ms

✔ Merge_WorksWithManyItems

33ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

2ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ Ctor_WithEnumerable

1ms

✔ Ctor_WithProvidedList

< 1ms

✔ Pop_RaisesExceptionOnEmptyQueue

< 1ms

✔ Pop_RespectsPriorities

< 1ms

✔ PushAndPop_WorkWithReferenceTypes

1ms

✔ PushAndPop_WorkWithValueTypes

< 1ms

✔ PushAndPop_WithPrioritiesPartiallyOrdered

< 1ms

✔ PushAndPop_ComplexScenario

62ms

✔ PushAndPop_AllPermutations

< 1ms

✔ PushAndPop_AreStable

< 1ms

✔ Count_IsCorrect

< 1ms

✔ Count_IsCorrectWithDuplicates

< 1ms

✔ Peek_RaisesExceptionOnEmptyQueue

< 1ms

✔ Peek_IsCorrect

< 1ms

✔ Peek_DoesntChangeTheContentOfTheQueue

< 1ms

✔ GetEnumerator_RetrievesAllItemsAccordingToPriority

< 1ms

✔ GetEnumerator_DoesntAlterQueueWhenIterated

< 1ms

✔ GetPrioritiesOf_FirstIsCorrect

2ms

✔ GetPrioritiesOf_IsCorrect

< 1ms

✔ UpdatePriority_RaisesExceptionOnItemNonPresent

< 1ms

✔ UpdatePriority_IsStableWithInt

< 1ms

✔ UpdatePriority_IsStableWithReferenceTypes

7ms

✔ UpdatePriority_IsCorrect

< 1ms

✔ UpdatePriority_AllPermutations

< 1ms

✔ UpdatePriority_LongChainOfUpdates (System.Int32[],System.Int32[],System.Int32[])

1ms

✔ UpdatePriority_StalePushTimestamps

< 1ms

✔ UpdatePriority_WorksWhenNewPriorityIsTheSame

< 1ms

✔ Remove_IsCorrect

< 1ms

✔ Remove_WorksWithReferenceTypes

< 1ms

✔ Remove_WorksWithValueTypes

4ms

✔ PeekKth_WorstQuickFindPivot

1ms

✔ PeekKth_ThrowsExceptionOnInvalidK

< 1ms

✔ PeekKth_IsCorrect

< 1ms

✔ PeekKth_IsStable

< 1ms

✔ Merge_QueueUpdatesKeepWorkingOnSourceAfter

< 1ms

✔ Merge_QueueUpdatesKeepWorkingOnTargetAfter

< 1ms

✔ Clear_QueueUpdatesKeepWorkingAfter

< 1ms

✔ Merge_WithEmptySource

< 1ms

✔ Merge_WithEmptyTarget

< 1ms

✔ Merge_ContainsElementsFromBothQueues

< 1ms

✔ Merge_WorksWithManyItems

1ms

✔ Merge_WorksWithDuplicates

< 1ms

✔ Merge_CanBeRepeatedWithMultipleTargets

< 1ms

✔ Merge_RemoveAllItemsFromTheTarget

< 1ms

✔ Merge_TargetIsUsableAfterMerge

< 1ms

✔ Merge_TargetChangesDontInterfereWithSource

< 1ms

✔ Merge_KeepsPushTimestampsUniqueWithinEras

< 1ms

✔ Merge_IfSamePriorityTakeItemsComingFromTargetAfterSource

< 1ms

✔ Merge_IfDifferentPrioritySortByItNoMatterIfFromSourceOrTarget

< 1ms

✔ Merge_IfSamePriorityTakeItemsAfterMergeAfterTarget

< 1ms

✔ Merge_SourceOfAMergeCanBeUsedAsTargetOfAnotherMerge

< 1ms

✔ Merge_TargetOfAMergeCanBeUsedAsSourceOfAnotherMerge

< 1ms

✔ MergeAndClear_ComplexScenario

< 1ms

✔ Clear_WipesAllItemsOut

< 1ms

✔ Clear_QueueKeepsWorkingAfter

< 1ms

✔ Clear_DoesntResetPushTimestamps

< 1ms

✔ IsSorted_WithComparable_IsCorrectWithNumbers

7ms

✔ IsSorted_WithComparable_IsCorrectWithBool

2ms

✔ IsSorted_WithComparable_IsCorrectWithChars

2ms

✔ IsSorted_WithComparer_IsCorrect

< 1ms

✔ Sort_PlaceItemsInOrder

1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

5ms

✔ Sort_WorksWithValueTypes

6ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

2ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Shuffle_DoesNothingWhenWindowIsEmptyOrSingleton

< 1ms

✔ Shuffle_PreservesTheContentOfTheInput (System.Int32[])

< 1ms

✔ Shuffle_PreservesTheContentOfTheInput (System.Int32[])

< 1ms

✔ Shuffle_PreservesTheContentOfTheInput (System.Int32[])

< 1ms

✔ Shuffle_PreservesTheContentOfTheInput (System.Int32[])

< 1ms

✔ Select_GivesAnIndexWithinTheBoundariesOfTheWindow

< 1ms

✔ Partition_IsCorrect

3ms

✔ Partition_IsCorrect

< 1ms

✔ Partition_IsCorrect

< 1ms

✔ Partition_IsCorrect

< 1ms

✔ Partition_IsCorrect

< 1ms

✔ Partition_IsCorrect

< 1ms

✔ Select_GivesAnIndexWithinTheBoundariesOfTheWindow

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Sort_PlaceItemsInOrder

< 1ms

✔ Sort_WorksWithDuplicates

< 1ms

✔ Sort_WorksWithEmptyList

< 1ms

✔ Sort_WorksWithSingletonList

< 1ms

✔ Sort_WorksWithReferenceTypes

< 1ms

✔ Sort_WorksWithValueTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithReferenceTypes

< 1ms

✔ Sort_TakesIntoAccountComparerWithValueTypes

< 1ms

✔ Select_GivesAnIndexWithinTheBoundariesOfTheWindow

< 1ms

✔ SearchMethods_OnListOfIntegers (ListOfIntegers1)

15ms

✔ SearchMethods_OnListOfIntegers (ListOfIntegers2)

< 1ms

✔ SearchMethods_OnCharArray (ArrayOfChars1)

11ms

✔ SearchMethods_OnString (String1)

1ms

✔ SearchMethods_OnString (String2)

< 1ms

✔ SearchMethods_ItemtNotFound (4)

< 1ms

✔ SearchMethods_ItemtNotFound (5)

< 1ms

✔ SearchMethods_ItemNotFound_OnStrings

< 1ms

✔ SearchMethods_OnEmptyEnumerable

2ms

✔ SearchMethods_FromIndexAndToIndexNull

< 1ms

✔ First_MiddleIndexOverflow

< 1ms

✔ First_OutOfBoundsIndexes

< 1ms

✔ Last_OutOfBoundsIndexes

< 1ms

✔ FirstAll_OutOfBoundsIndexes

< 1ms

✔ Nth_RaisesExceptionOnInvalidOccurrenceRank

< 1ms

✔ FirstAll_OnCustomIntervals

< 1ms

✔ SearchMethods_OnListOfIntegers (ListOfIntegers1)

9ms

✔ SearchMethods_OnListOfIntegers (ListOfIntegers2)

< 1ms

✔ SearchMethods_OnCharArray (ArrayOfChars1)

8ms

✔ SearchMethods_OnString (String1)

1ms

✔ SearchMethods_OnString (String2)

< 1ms

✔ SearchMethods_ItemtNotFound (4)

< 1ms

✔ SearchMethods_ItemtNotFound (5)

< 1ms

✔ SearchMethods_ItemNotFound_OnStrings

< 1ms

✔ SearchMethods_OnEmptyEnumerable

8ms

✔ SearchMethods_FromIndexAndToIndexNull

< 1ms

✔ First_MiddleIndexOverflow

< 1ms

✔ First_OutOfBoundsIndexes

< 1ms

✔ Last_OutOfBoundsIndexes

< 1ms

✔ FirstAll_OutOfBoundsIndexes

< 1ms

✔ Nth_RaisesExceptionOnInvalidOccurrenceRank

< 1ms

✔ FirstAll_OnCustomIntervals

< 1ms

✔ Count_IsCorrect (EmptyEnumerable)

7ms

✔ Count_IsCorrect (EmptyArray)

< 1ms

✔ Count_IsCorrect (SingletonList)

< 1ms

✔ Count_IsCorrect (SingletonArray)

< 1ms

✔ Count_IsCorrect (ThreeElementsWithoutRepetitions)

< 1ms

✔ Count_IsCorrect (ThreeElementsWithOneRepetitions)

< 1ms

✔ Count_IsCorrect (ThreeElementsWithTwoRepetitions)

< 1ms

✔ Count_IsCorrect (MultipleRepetedElements)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],)

1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],ab)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],abba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],ababa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aabaabaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],abcabcabc)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],abbaabbab)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],)

1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],ab)

1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],abba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],ababa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],aabaabaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],abcabcabc)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.Int32[],abbaabbab)

< 1ms

✔ Match_IsCorrect (abcdabcaba,a,System.Int32[])

2ms

✔ Match_IsCorrect (abcdabcaba,ab,System.Int32[])

< 1ms

✔ Match_IsCorrect (abcdabcaba,abc,System.Int32[])

< 1ms

✔ Match_IsCorrect (abcdabcaba,abcd,System.Int32[])

< 1ms

✔ Match_IsCorrect (abcdabcaba,abcde,System.Int32[])

< 1ms

✔ Match_IsCorrect (abcdabcaba,e,System.Int32[])

< 1ms

✔ Match_ReturnsNoMatchWithEmptyText

< 1ms

✔ Match_ThrowsExceptionWithEmptyPattern

< 1ms

✔ Match_DoesntValidateTextAndPatternAgainstSeparatorByDefault

< 1ms

✔ Match_RaisesExceptionWhenTextAndPatternAreValidatedAgainstSeparator

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],ab)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],abba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],ababa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aabaabaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],abcabcabc)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],ab)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],abba)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],ababa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],aabaabaa)

< 1ms

✔ GetAllBordersByDescLength_IsCorrect (System.String[],abcabcabc)

< 1ms

✔ GetAllEdges_IsCorrect (1,System.Int32[],System.Int32[])

5ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (3,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (5,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (9,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (1,System.Int32[],System.Int32[])

10ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

2ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (3,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (5,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (9,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (1,System.Int32[],System.Int32[])

1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (3,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (5,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (9,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (1,System.Int32[],System.Int32[])

3ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (3,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (5,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (9,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (1,System.Int32[],System.Int32[])

2ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (3,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (5,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (9,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (1,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (3,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (5,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (9,System.Int32[],System.Int32[])

< 1ms

✔ Indexer_TakesDataFromUnderlyingDictionary

4ms

✔ Indexer_RaisesExceptionWhenProvidedEdgeIsUnknown

< 1ms

✔ GetAllEdges_IsCorrect (1,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (3,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (5,System.Int32[],System.Int32[])

< 1ms

✔ GetAllEdges_IsCorrect (9,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (1,System.Int32[],System.Int32[])

4ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (3,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (5,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_IsCorrect (9,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (1,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (2,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (3,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (5,System.Int32[],System.Int32[])

< 1ms

✔ Reverse_OfReverseIsInitialGraph (9,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

6ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

3ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (6 V, 1 source, 4 intermediate, 1 sink,6,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain,7,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (8 V, source to 3-chain and intermediate to three leaves,8,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 1,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 2,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 3,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (4 V, source to 1 sink and 1 intermediate to sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

2ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink inverted,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (6 V, 1 isolated, 1 source to sink, 1 3-C,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 1 isolated, 1 source to sink, 1 3-C inverted,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 2-roots dag with central vertex,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, quasi-tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[])

4ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated with loop,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 isolated, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitEvents_BasicChecksInDepthFirstSearch

12ms

✔ VisitEvents_BasicChecksInConnectedComponents

< 1ms

✔ VisitEvents_BasicChecksInVisit

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, source to sink,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, sink to source,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (3V, source to intermediate to sink,3,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (3V, source to intermediate to sink,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

4ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (2V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (5V, 1 5-C, 1 4-C, 1 3-C, 1 2-C,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

4ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

6ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (6 V, 1 source, 4 intermediate, 1 sink,6,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain,7,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (8 V, source to 3-chain and intermediate to three leaves,8,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 1,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 2,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 3,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (4 V, source to 1 sink and 1 intermediate to sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink inverted,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (6 V, 1 isolated, 1 source to sink, 1 3-C,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 1 isolated, 1 source to sink, 1 3-C inverted,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 2-roots dag with central vertex,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, quasi-tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated with loop,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 isolated, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitEvents_BasicChecksInDepthFirstSearch

< 1ms

✔ VisitEvents_BasicChecksInConnectedComponents

< 1ms

✔ VisitEvents_BasicChecksInVisit

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, source to sink,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, sink to source,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (3V, source to intermediate to sink,3,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (3V, source to intermediate to sink,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (2V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (5V, 1 5-C, 1 4-C, 1 3-C, 1 2-C,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (6 V, 1 source, 4 intermediate, 1 sink,6,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain,7,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (8 V, source to 3-chain and intermediate to three leaves,8,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 1,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 2,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 3,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (4 V, source to 1 sink and 1 intermediate to sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink inverted,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (6 V, 1 isolated, 1 source to sink, 1 3-C,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 1 isolated, 1 source to sink, 1 3-C inverted,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 2-roots dag with central vertex,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, quasi-tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated with loop,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 isolated, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitEvents_BasicChecksInDepthFirstSearch

< 1ms

✔ VisitEvents_BasicChecksInConnectedComponents

< 1ms

✔ VisitEvents_BasicChecksInVisit

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, source to sink,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, sink to source,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (3V, source to intermediate to sink,3,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (3V, source to intermediate to sink,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (2V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (5V, 1 5-C, 1 4-C, 1 3-C, 1 2-C,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 0 E,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 1 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (1 V, 2 L,1,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 0 E,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, each 1 L,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 inverted 2-C,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 L, 1 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 3 L, 3 2-C,3,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (2 V, 1 pointing to global sink,2,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (3 V, 2 pointing to global sink,3,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],1,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, 2 pointing to 2-chain jumping back,4,System.Int32[],System.Int32[],2,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (4 V, source pointing to leaf and 2-chain,4,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (6 V, 1 source, 4 intermediate, 1 sink,6,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain,7,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertex_IsCorrect (8 V, source to 3-chain and intermediate to three leaves,8,System.Int32[],System.Int32[],0,System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 1,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 2,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ BreadthSearchFromVertices_IsCorrect (7 V, 1 3-C, 1 2-chain, 1 2-chain sharing leaf with 1-chain 3,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (4 V, source to 1 sink and 1 intermediate to sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 3 isolated, 1 source to sink inverted,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (6 V, 1 isolated, 1 source to sink, 1 3-C,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 1 isolated, 1 source to sink, 1 3-C inverted,6,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (5 V, 2-roots dag with central vertex,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ DepthFirstSearchOfGraph_IsCorrect (7 V, quasi-tree, 1 2-chain, 1 3-chain, 1 4-chain,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 2-C, 1 isolated with loop,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ ConnectedComponents_IsCorrect (3 V, 1 isolated, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitEvents_BasicChecksInDepthFirstSearch

< 1ms

✔ VisitEvents_BasicChecksInConnectedComponents

< 1ms

✔ VisitEvents_BasicChecksInVisit

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, source to sink,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (2V, sink to source,2,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (3V, source to intermediate to sink,3,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingVertex_InDepthFirstSearchOfGraphIsAccordingToOutput (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (3V, source to intermediate to sink,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 sources to 1 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 1 source to 2 intermediate to 1 sink,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ VisitingAndVisitedVertex_InDepthFirstSearchOfGraph_AreCorrect (4V, 2 3-C overlapping on 2 vertices,4,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (2V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (3V, 1 3-C, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ AlreadyVisitedVertex_InDepthFirstSearchOfGraph_IsCorrect (5V, 1 5-C, 1 4-C, 1 3-C, 1 2-C,5,System.Int32[],System.Int32[],System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[])

2ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 2-C, 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 2-C, 1 isolated with loop,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 isolated, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (4 V, source to 3-C,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[])

1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 1 2-C,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 3-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 2-C, 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 2-C, 1 isolated with loop,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, 1 isolated, 1 2-C,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (4 V, source to 3-C,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (1V, no edges,1,System.Int32[],System.Int32[],System.Int32[])

1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (4V, 1 4-chain,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (5V, 1 source, 3 intermediate, 1 sink,5,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (2V, no edges,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing each to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing both to 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 1 source, 1 intermediate, 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (5V, 2 sources, 2 intermediate, 1 sink,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (6V, 2 sources, 3 intermediate, 1 sink,6,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C inverted,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 2-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 3-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 4-C,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 3-chain, 1 isolated,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (5V, 1 source, 3 intermediate, 1 sink, 1 3-C,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (1V, no edges,1,System.Int32[],System.Int32[],System.Int32[])

5ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (4V, 1 4-chain,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (5V, 1 source, 3 intermediate, 1 sink,5,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (2V, no edges,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing each to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing both to 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 1 source, 1 intermediate, 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (5V, 2 sources, 2 intermediate, 1 sink,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (6V, 2 sources, 3 intermediate, 1 sink,6,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C inverted,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 2-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 3-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 4-C,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 3-chain, 1 isolated,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (5V, 1 source, 3 intermediate, 1 sink, 1 3-C,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (1V, no edges,1,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (4V, 1 4-chain,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (5V, 1 source, 3 intermediate, 1 sink,5,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (2V, no edges,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing each to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing both to 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 1 source, 1 intermediate, 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (5V, 2 sources, 2 intermediate, 1 sink,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (6V, 2 sources, 3 intermediate, 1 sink,6,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C inverted,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 2-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 3-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 4-C,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 3-chain, 1 isolated,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (5V, 1 source, 3 intermediate, 1 sink, 1 3-C,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (1V, no edges,1,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (4V, 1 4-chain,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (5V, 1 source, 3 intermediate, 1 sink,5,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (2V, no edges,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing each to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing both to 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 1 source, 1 intermediate, 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (5V, 2 sources, 2 intermediate, 1 sink,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (6V, 2 sources, 3 intermediate, 1 sink,6,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C inverted,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 2-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 3-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 4-C,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 3-chain, 1 isolated,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (5V, 1 source, 3 intermediate, 1 sink, 1 3-C,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (1V, no edges,1,System.Int32[],System.Int32[],System.Int32[])

1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, source to sink,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (2V, sink from source,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (4V, 1 4-chain,4,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenSingleSolutionIsPossible (5V, 1 source, 3 intermediate, 1 sink,5,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (2V, no edges,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing each to 1 sink,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 2 sources pointing both to 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (4V, 1 source, 1 intermediate, 2 sinks,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (5V, 2 sources, 2 intermediate, 1 sink,5,System.Int32[],System.Int32[])

< 1ms

✔ Sort_IsCorrectWhenMultipleSolutionsArePossible (6V, 2 sources, 3 intermediate, 1 sink,6,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (2V, 1 2-C inverted,2,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 2-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (3V, 1 3-C,3,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 4-C,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (4V, 1 3-chain, 1 isolated,4,System.Int32[],System.Int32[])

< 1ms

✔ Sort_RaisesExceptionWhenNoDag (5V, 1 source, 3 intermediate, 1 sink, 1 3-C,5,System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],0,0,0,System.Int32[])

4ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],0,1,1,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],0,1,1,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf,3,System.Int32[],System.Int32[],0,2,1,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf,5,System.Int32[],System.Int32[],0,3,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf,9,System.Int32[],System.Int32[],0,7,4,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (5 V, source and positive 3-C with nested 2-C to sink,5,System.Int32[],System.Int32[],System.Int32[])

16ms

✔ Find_IsCorrectWithNegativeCycles (4 V, source to 2-C, both to sink,4,System.Int32[],System.Int32[],System.Int32[])

1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[])

34ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0)

2ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0)

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[])

3ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

2ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

10ms

✔ Find_IsCorrectWithNegativeValues (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,-1,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (3 V, source to sink and isolated,3,System.Int32[],System.Int32[],System.Int32[],0,2,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (3 V, source and intermediate to sink 1,3,System.Int32[],System.Int32[],System.Int32[],0,1,-1,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (3 V, source and intermediate to sink 2,3,System.Int32[],System.Int32[],System.Int32[],0,1,-1,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (3 V, source and intermediate to sink 3,3,System.Int32[],System.Int32[],System.Int32[],0,1,0,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (4 V, source and positive 2-C to sink,4,System.Int32[],System.Int32[],System.Int32[],0,3,0,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeValues (5 V, source and positive 3-C with nested 2-C to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,-1,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeCycles (2 V, 1 2-C 1,2,System.Int32[],System.Int32[],System.Int32[],0,0,-2147483648,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeCycles (2 V, 1 2-C 2,2,System.Int32[],System.Int32[],System.Int32[],0,1,-2147483648,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeCycles (2 V, 1 2-C 3,2,System.Int32[],System.Int32[],System.Int32[],0,1,-2147483648,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeCycles (3 V, source to intermediate to 2-C,3,System.Int32[],System.Int32[],System.Int32[],0,2,-2147483648,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeCycles (4 V, source to sink and 2-C,4,System.Int32[],System.Int32[],System.Int32[],0,1,1,System.Int32[])

< 1ms

✔ Find_IsCorrectWithNegativeCycles (4 V, source to 2-C, both to sink,4,System.Int32[],System.Int32[],System.Int32[],0,1,-2147483648,System.Int32[])

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

2ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

6ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],System.Int32[])

16ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (3 V, negative 3-C,3,System.Int32[],System.Int32[],System.Int32[],0,2)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3)

< 1ms

✔ Find_RaisesExceptionWhenNegativeEdgesAreEncountered (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8)

< 1ms

✔ Find_ThrowsExceptionWithInvalidStartOrEnd (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (1 V, 1 isolated,1,System.Int32[],System.Int32[],System.Int32[],0,0,0,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2 isolated,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, sink from source,2,System.Int32[],System.Int32[],System.Int32[],0,1,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],0,1,4,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],0,2,3,System.Int32[])

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain, sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],0,2,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 1,5,System.Int32[],System.Int32[],System.Int32[],0,3,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 2-chain and 1-chain, sharing leaf 2,5,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing middle vertex,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, source to 4-chain with edge bypassing 3 vertices in the middle,5,System.Int32[],System.Int32[],System.Int32[],0,4,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (5 V, 2 connected components: source to sink and source to intermediate to sink,5,System.Int32[],System.Int32[],System.Int32[],0,4,2147483647,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, 5-C of vertices at distance 0, each to sink,6,System.Int32[],System.Int32[],System.Int32[],0,5,2,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 1-chain and 3-chain merging to sink,6,System.Int32[],System.Int32[],System.Int32[],0,3,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, sink meeting point found going forward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (6 V, source to 4-chain and 2-chain merging to sink, source meeting point found going backward,6,System.Int32[],System.Int32[],System.Int32[],0,5,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (7 V, source to sink, same source to 1-chain and 3-chain merging to vertex to sink,7,System.Int32[],System.Int32[],System.Int32[],0,6,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to sink, same source to 1-chain and 3-chain merging to 3-chain to sink,9,System.Int32[],System.Int32[],System.Int32[],0,8,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to 2-chain and 1-chain merging to intermediate, to 2-chain and 1-chain merging to leaf 2,9,System.Int32[],System.Int32[],System.Int32[],0,7,7,System.Int32[])

< 1ms

✔ Find_IsCorrect (9 V, source to chains merging to intermediate, to chains merging to leaf, with shortcut to leaf 1,9,System.Int32[],System.Int32[],System.Int32[],0,7,5,System.Int32[])

< 1ms

✔ Find_IsCorrect (11 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1,11,System.Int32[],System.Int32[],System.Int32[],0,10,6,System.Int32[])

< 1ms

✔ Find_IsCorrect (Empty,0,System.Int32[],System.Int32[],System.Int32[],0)

4ms

✔ Find_IsCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],0)

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],4)

2ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],2)

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],4)

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf 3,3,System.Int32[],System.Int32[],System.Int32[],1)

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf back to source with negative cycle,3,System.Int32[],System.Int32[],System.Int32[],-3)

< 1ms

✔ Find_IsCorrect (4 V, source to 2 vertices of 3-C, which themselves form a 2-C 1,4,System.Int32[],System.Int32[],System.Int32[],-4)

< 1ms

✔ Find_IsCorrect (4 V, source to 2 vertices of 3-C, which themselves form a 2-C 2,4,System.Int32[],System.Int32[],System.Int32[],4)

< 1ms

✔ Find_IsCorrect (4 V, source to 2 2-C, one of which goint to sink,4,System.Int32[],System.Int32[],System.Int32[],5)

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (2V isolated, no edges,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (2V isolated, 2-L,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (3V, 1 2-C and 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (12 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1, 1 isolated,12,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_IsCorrect (Empty,0,System.Int32[],System.Int32[],System.Int32[],0)

1ms

✔ Find_IsCorrect (1V, 1-L,1,System.Int32[],System.Int32[],System.Int32[],0)

< 1ms

✔ Find_IsCorrect (2 V, 2-L, source to sink,2,System.Int32[],System.Int32[],System.Int32[],4)

2ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf 1,3,System.Int32[],System.Int32[],System.Int32[],2)

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf 2,3,System.Int32[],System.Int32[],System.Int32[],4)

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf 3,3,System.Int32[],System.Int32[],System.Int32[],1)

< 1ms

✔ Find_IsCorrect (3 V, source to 2-chain and 1-chain sharing leaf back to source with negative cycle,3,System.Int32[],System.Int32[],System.Int32[],-3)

< 1ms

✔ Find_IsCorrect (4 V, source to 2 vertices of 3-C, which themselves form a 2-C 1,4,System.Int32[],System.Int32[],System.Int32[],-4)

< 1ms

✔ Find_IsCorrect (4 V, source to 2 vertices of 3-C, which themselves form a 2-C 2,4,System.Int32[],System.Int32[],System.Int32[],4)

< 1ms

✔ Find_IsCorrect (4 V, source to 2 2-C, one of which goint to sink,4,System.Int32[],System.Int32[],System.Int32[],5)

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (2V isolated, no edges,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (2V isolated, 2-L,2,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (3V, 1 2-C and 1 isolated,3,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_ThrowsExceptionIfTheGraphIsNotConnected (12 V, source to chains merging to intermediate, to chains merging to intermediate to leaf 1, 1 isolated,12,System.Int32[],System.Int32[],System.Int32[])

< 1ms

✔ Find_MakesTreeFlat

< 1ms

✔ GetRanks_IsZeroAfterCtor

< 1ms

✔ GetRanks_ReturnsCopy

< 1ms

✔ Union_UpdatesRanks

< 1ms

✔ Union_MergesByRank

< 1ms

✔ Union_MinimizesRankGrow (1)

< 1ms

✔ Union_MinimizesRankGrow (5)

< 1ms

✔ Union_MinimizesRankGrow (8)

< 1ms

✔ Union_MinimizesRankGrow (10)

< 1ms

✔ Ctor_SetsValuesCountAccordingly

< 1ms

✔ Ctor_SetsSetsCountAccordingly

< 1ms

✔ Ctor_RaisesExceptionOnInvalidValuesCount

< 1ms

✔ SetsCount_IsCorrect

< 1ms

✔ SetCounts_WithTransitivity

< 1ms

✔ AreConnected_RaisesExceptionOnInvalidValues

< 1ms

✔ AreConnected_RaisesExceptionOnEmptyQueue

< 1ms

✔ AreConnected_IsReflexive

< 1ms

✔ AreConnected_IsSymmetric

< 1ms

✔ AreConnected_IsTransitive

< 1ms

✔ Find_ThrowsExceptionOnInvalidValue

< 1ms

✔ Find_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Find_ReturnsDifferentSetIdsForNonConnectedValues

< 1ms

✔ Find_ReturnsSameSetIdForConnectedValues

< 1ms

✔ Find_IsReflexive

< 1ms

✔ Find_IsSymmetric

< 1ms

✔ Find_IsTransitive

< 1ms

✔ Union_IsIdempotent

< 1ms

✔ Union_ThrowsExceptionOnInvalidValues

< 1ms

✔ Union_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Union_BehavesCorrectlyWithCycles

< 1ms

✔ Ctor_SetsValuesCountAccordingly

< 1ms

✔ Ctor_SetsSetsCountAccordingly

< 1ms

✔ Ctor_RaisesExceptionOnInvalidValuesCount

< 1ms

✔ SetsCount_IsCorrect

< 1ms

✔ SetCounts_WithTransitivity

< 1ms

✔ AreConnected_RaisesExceptionOnInvalidValues

< 1ms

✔ AreConnected_RaisesExceptionOnEmptyQueue

< 1ms

✔ AreConnected_IsReflexive

< 1ms

✔ AreConnected_IsSymmetric

< 1ms

✔ AreConnected_IsTransitive

< 1ms

✔ Find_ThrowsExceptionOnInvalidValue

< 1ms

✔ Find_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Find_ReturnsDifferentSetIdsForNonConnectedValues

< 1ms

✔ Find_ReturnsSameSetIdForConnectedValues

< 1ms

✔ Find_IsReflexive

< 1ms

✔ Find_IsSymmetric

< 1ms

✔ Find_IsTransitive

< 1ms

✔ Union_IsIdempotent

< 1ms

✔ Union_ThrowsExceptionOnInvalidValues

< 1ms

✔ Union_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Union_BehavesCorrectlyWithCycles

< 1ms

✔ Ctor_SetsValuesCountAccordingly

< 1ms

✔ Ctor_SetsSetsCountAccordingly

< 1ms

✔ Ctor_RaisesExceptionOnInvalidValuesCount

< 1ms

✔ SetsCount_IsCorrect

< 1ms

✔ SetCounts_WithTransitivity

< 1ms

✔ AreConnected_RaisesExceptionOnInvalidValues

< 1ms

✔ AreConnected_RaisesExceptionOnEmptyQueue

< 1ms

✔ AreConnected_IsReflexive

< 1ms

✔ AreConnected_IsSymmetric

< 1ms

✔ AreConnected_IsTransitive

< 1ms

✔ Find_ThrowsExceptionOnInvalidValue

< 1ms

✔ Find_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Find_ReturnsDifferentSetIdsForNonConnectedValues

< 1ms

✔ Find_ReturnsSameSetIdForConnectedValues

< 1ms

✔ Find_IsReflexive

< 1ms

✔ Find_IsSymmetric

< 1ms

✔ Find_IsTransitive

< 1ms

✔ Union_IsIdempotent

< 1ms

✔ Union_ThrowsExceptionOnInvalidValues

< 1ms

✔ Union_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Union_BehavesCorrectlyWithCycles

< 1ms

✔ GetRanks_IsZeroAfterCtor

< 1ms

✔ GetRanks_ReturnsCopy

< 1ms

✔ Union_UpdatesRanks

< 1ms

✔ Union_MergesByRank

< 1ms

✔ Union_MinimizesRankGrow (1)

< 1ms

✔ Union_MinimizesRankGrow (5)

< 1ms

✔ Union_MinimizesRankGrow (8)

< 1ms

✔ Union_MinimizesRankGrow (10)

< 1ms

✔ Ctor_SetsValuesCountAccordingly

< 1ms

✔ Ctor_SetsSetsCountAccordingly

< 1ms

✔ Ctor_RaisesExceptionOnInvalidValuesCount

< 1ms

✔ SetsCount_IsCorrect

< 1ms

✔ SetCounts_WithTransitivity

< 1ms

✔ AreConnected_RaisesExceptionOnInvalidValues

< 1ms

✔ AreConnected_RaisesExceptionOnEmptyQueue

< 1ms

✔ AreConnected_IsReflexive

< 1ms

✔ AreConnected_IsSymmetric

< 1ms

✔ AreConnected_IsTransitive

< 1ms

✔ Find_ThrowsExceptionOnInvalidValue

< 1ms

✔ Find_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Find_ReturnsDifferentSetIdsForNonConnectedValues

< 1ms

✔ Find_ReturnsSameSetIdForConnectedValues

< 1ms

✔ Find_IsReflexive

< 1ms

✔ Find_IsSymmetric

< 1ms

✔ Find_IsTransitive

< 1ms

✔ Union_IsIdempotent

< 1ms

✔ Union_ThrowsExceptionOnInvalidValues

< 1ms

✔ Union_ThrowsExceptionOnEmptyQueue

< 1ms

✔ Union_BehavesCorrectlyWithCycles

< 1ms

✔ WrappedEdge_IsPreserved

< 1ms

✔ Equals_BasedOnWrappedEdge

< 1ms

✔ Equals_BasedOnWrappedNode

1ms

✔ Children_PreservedWrappedStructure

2ms

✔ WrappedNode_IsPreserved

< 1ms

✔ DescendantsCount_OfLeafIsZero

< 1ms

✔ DescendantsCount_OfSingletonIsOne

< 1ms

✔ DescendantsCount_OfThreeWithNNodesIsN

< 1ms

✔ DescendantsCount_GivesConsistentResults

< 1ms

✔ DescendantsCount_DoesntStackOverflowWithDeepStructures

22ms

✔ Ctor_AssignsContentSpecified

< 1ms

✔ Equals_ByValue

1ms

✔ GetHashCode_ByValue

< 1ms

✔ Content_ReturnsAnImmutableCollection

< 1ms

✔ Transform_IsCorrect

2ms

✔ Transform_HasSameLengthAsTextPlusTerminator

1ms

✔ FirstColumnAndLastColumn_AreConsistent

2ms

✔ FirstColumn_IsATextPermutation

< 1ms

✔ LastColumn_IsATextPermutation

< 1ms

✔ Length_IsTheSameOfLengthOfText

< 1ms

✔ Quicksort_WithDefaultComparer

6ms

✔ Quicksort_WithCustomComparer

< 1ms

✔ Quicksort_IndexesMappingIsCorrect

< 1ms

✔ Ctor_RaisesExceptionWithIncosistentBWTAndSortedBWT

1ms

✔ Match_RaisesExceptionWithEmptyPattern

2ms

✔ Match_IsCorrectWhenFailure (mississippi,xissi,False,4,3,4)

5ms

✔ Match_IsCorrectWhenFailure (mississippi,issix,False,0,-1,-1)

1ms

✔ Match_IsCorrectWhenFailure (mississippi,x,False,0,-1,-1)

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,$,True,1,0,0)

2ms

✔ Match_IsCorrectWhenSuccess (mississippi,i$,True,2,1,1)

2ms

✔ Match_IsCorrectWhenSuccess (mississippi,issi,True,4,3,4)

2ms

✔ Match_IsCorrectWhenSuccess (mississippi,issip,True,5,3,3)

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,s,True,1,8,11)

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,mi,True,2,5,5)

2ms

✔ Match_IsCorrectWhenSuccess (mississippi,mis,True,3,5,5)

2ms

✔ Match_IsCorrectWhenSuccess (baba,ba,True,2,3,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (baba,bab,True,3,4,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (aaaaaaaaaaa,a,True,1,1,11)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,a,True,1,1,7)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,a$,True,2,1,1)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,aa,True,2,2,3)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,ab,True,2,4,6)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,ac,True,2,7,7)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,abaa,True,4,4,5)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,abaab,True,5,4,5)

3ms

✔ Ctor_RaisesExceptionWithIncosistentBWTAndSortedBWT

< 1ms

✔ Match_RaisesExceptionWithEmptyPattern

< 1ms

✔ Match_IsCorrectWhenFailure (mississippi,xissi,False,4,3,4)

7ms

✔ Match_IsCorrectWhenFailure (mississippi,issix,False,0,-1,-1)

1ms

✔ Match_IsCorrectWhenFailure (mississippi,x,False,0,-1,-1)

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,$,True,1,0,0)

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,i$,True,2,1,1)

2ms

✔ Match_IsCorrectWhenSuccess (mississippi,issi,True,4,3,4)

4ms

✔ Match_IsCorrectWhenSuccess (mississippi,issip,True,5,3,3)

4ms

✔ Match_IsCorrectWhenSuccess (mississippi,s,True,1,8,11)

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,mi,True,2,5,5)

3ms

✔ Match_IsCorrectWhenSuccess (mississippi,mis,True,3,5,5)

3ms

✔ Match_IsCorrectWhenSuccess (baba,ba,True,2,3,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (baba,bab,True,3,4,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (aaaaaaaaaaa,a,True,1,1,11)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,a,True,1,1,7)

3ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,a$,True,2,1,1)

5ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,aa,True,2,2,3)

6ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,ab,True,2,4,6)

5ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,ac,True,2,7,7)

4ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,abaa,True,4,4,5)

26ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,abaab,True,5,4,5)

9ms

✔ Match_IsCorrect (mississippi,xissi,False,0,-1,-1)

2ms

✔ Match_IsCorrect (mississippi,issix,False,4,3,3)

< 1ms

✔ Match_IsCorrect (mississippi,x,False,0,-1,-1)

< 1ms

✔ Match_IsCorrect (abaabaabbacba,abaabc,False,5,4,4)

< 1ms

✔ Match_IsCorrect (abaabaabbacba,abaabac,False,6,4,4)

< 1ms

✔ Match_IsCorrect (abaa,abaa$b,False,5,3,3)

< 1ms

✔ BWT_IsNotSupported

< 1ms

✔ Ctor_WithSuffixArrayWithDynamicIndexes

1ms

✔ Match_IsCorrectWhenSuccess (mississippi,$,True,1,0,0)

< 1ms

✔ Match_IsCorrectWhenSuccess (mississippi,i$,True,2,1,1)

< 1ms

✔ Match_IsCorrectWhenSuccess (mississippi,issi,True,4,3,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (mississippi,issip,True,5,3,3)

< 1ms

✔ Match_IsCorrectWhenSuccess (mississippi,s,True,1,8,11)

< 1ms

✔ Match_IsCorrectWhenSuccess (mississippi,mi,True,2,5,5)

< 1ms

✔ Match_IsCorrectWhenSuccess (mississippi,mis,True,3,5,5)

< 1ms

✔ Match_IsCorrectWhenSuccess (baba,ba,True,2,3,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (baba,bab,True,3,4,4)

< 1ms

✔ Match_IsCorrectWhenSuccess (aaaaaaaaaaa,a,True,1,1,11)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,a,True,1,1,7)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,a$,True,2,1,1)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,aa,True,2,2,3)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,ab,True,2,4,6)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,ac,True,2,7,7)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,abaa,True,4,4,5)

< 1ms

✔ Match_IsCorrectWhenSuccess (abaabaabbacba,abaab,True,5,4,5)

< 1ms

✔ Compare_IsCorrect

8ms

✔ Compare_IsCorrect

< 1ms

✔ BuildMatrix_ReturnsAllRotationsOfText

5ms

✔ BuildMatrix_ReturnsRotationsSorted

< 1ms

✔ BuildMatrix_AllRotationsAreDifferent

< 1ms

✔ BuildMatrix_LastFirstProperty

1ms

✔ BuildMatrix_FromTransform_IsCorrect (Banana)

5ms

✔ BuildMatrix_FromTransform_IsCorrect (Allele)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Mississippi)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (BurrowsWheelerTransform)

1ms

✔ BuildMatrix_FromTransform_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithText_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithText_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertMatrix_IsCorrect (Banana)

< 1ms

✔ InvertMatrix_IsCorrect (Allele)

< 1ms

✔ InvertMatrix_IsCorrect (Mississippi)

< 1ms

✔ InvertMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ InvertMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertTransform_IsCorrect (Banana)

2ms

✔ InvertTransform_IsCorrect (Allele)

< 1ms

✔ InvertTransform_IsCorrect (Mississippi)

1ms

✔ InvertTransform_IsCorrect (BurrowsWheelerTransform)

12ms

✔ InvertTransform_IsCorrect (PanamaBananas)

3ms

✔ BuildMatrix_ReturnsAllRotationsOfText

< 1ms

✔ BuildMatrix_ReturnsRotationsSorted

< 1ms

✔ BuildMatrix_AllRotationsAreDifferent

< 1ms

✔ BuildMatrix_LastFirstProperty

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Banana)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Allele)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Mississippi)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (BurrowsWheelerTransform)

1ms

✔ BuildMatrix_FromTransform_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithText_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithText_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertMatrix_IsCorrect (Banana)

< 1ms

✔ InvertMatrix_IsCorrect (Allele)

< 1ms

✔ InvertMatrix_IsCorrect (Mississippi)

< 1ms

✔ InvertMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ InvertMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertTransform_IsCorrect (Banana)

1ms

✔ InvertTransform_IsCorrect (Allele)

< 1ms

✔ InvertTransform_IsCorrect (Mississippi)

1ms

✔ InvertTransform_IsCorrect (BurrowsWheelerTransform)

20ms

✔ InvertTransform_IsCorrect (PanamaBananas)

4ms

✔ BuildMatrix_ReturnsAllRotationsOfText

< 1ms

✔ BuildMatrix_ReturnsRotationsSorted

< 1ms

✔ BuildMatrix_AllRotationsAreDifferent

< 1ms

✔ BuildMatrix_LastFirstProperty

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Banana)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Allele)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Mississippi)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (BurrowsWheelerTransform)

1ms

✔ BuildMatrix_FromTransform_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithText_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithText_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertMatrix_IsCorrect (Banana)

< 1ms

✔ InvertMatrix_IsCorrect (Allele)

< 1ms

✔ InvertMatrix_IsCorrect (Mississippi)

< 1ms

✔ InvertMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ InvertMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertTransform_IsCorrect (Banana)

< 1ms

✔ InvertTransform_IsCorrect (Allele)

< 1ms

✔ InvertTransform_IsCorrect (Mississippi)

< 1ms

✔ InvertTransform_IsCorrect (BurrowsWheelerTransform)

1ms

✔ InvertTransform_IsCorrect (PanamaBananas)

< 1ms

✔ BuildMatrix_ReturnsAllRotationsOfText

< 1ms

✔ BuildMatrix_ReturnsRotationsSorted

< 1ms

✔ BuildMatrix_AllRotationsAreDifferent

< 1ms

✔ BuildMatrix_LastFirstProperty

1ms

✔ BuildMatrix_FromTransform_IsCorrect (Banana)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Allele)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (Mississippi)

< 1ms

✔ BuildMatrix_FromTransform_IsCorrect (BurrowsWheelerTransform)

1ms

✔ BuildMatrix_FromTransform_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithText_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithText_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithText_IsCorrect (PanamaBananas)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Banana)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Allele)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (Mississippi)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ BuildTransform_WithMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertMatrix_IsCorrect (Banana)

< 1ms

✔ InvertMatrix_IsCorrect (Allele)

< 1ms

✔ InvertMatrix_IsCorrect (Mississippi)

< 1ms

✔ InvertMatrix_IsCorrect (BurrowsWheelerTransform)

< 1ms

✔ InvertMatrix_IsCorrect (PanamaBananas)

< 1ms

✔ InvertTransform_IsCorrect (Banana)

< 1ms

✔ InvertTransform_IsCorrect (Allele)

< 1ms

✔ InvertTransform_IsCorrect (Mississippi)

< 1ms

✔ InvertTransform_IsCorrect (BurrowsWheelerTransform)

1ms

✔ InvertTransform_IsCorrect (PanamaBananas)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,0,0,0,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,0,1,4,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,4,0,0,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,4,1,4,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,1,0,1,0)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,2,0,2,3)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,2,1,3,4)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,3,0,2,3)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,3,1,3,4)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,-1,0)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,0,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,0,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,1,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,1,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,2,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,2,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,0,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,1,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,2,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,3,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,4,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,5,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,6,2)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,1,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,0,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,3,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,4,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,2,1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,5,1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,6,2)

< 1ms

✔ FindOccurrenceOfCharInSortedBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,-1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,10)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,0,8)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,1,9)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,2,4)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,3,1)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,4,10)

< 1ms

✔ Ctor_SetsBWTAndSortedBWT

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,0,0,0,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,0,1,4,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,4,0,0,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,4,1,4,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,1,0,1,0)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,2,0,2,3)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,2,1,3,4)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,3,0,2,3)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,3,1,3,4)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,-1,0)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,0,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,0,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,1,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,1,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,2,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,2,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,0,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,1,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,2,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,3,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,4,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,5,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,6,2)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,1,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,0,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,3,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,4,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,2,1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,5,1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,6,2)

< 1ms

✔ FindOccurrenceOfCharInSortedBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,-1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,10)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,0,8)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,1,9)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,2,4)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,3,1)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,4,10)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,0,0,0,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,0,1,4,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,4,0,0,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bca,$,4,1,4,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,1,0,1,0)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,2,0,2,3)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,2,1,3,4)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,3,0,2,3)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_IsCorrect (a$bba,$,3,1,3,4)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,-1,0)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,0,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,0,2)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,1,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,1,1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,2,-1)

< 1ms

✔ FindIndexOfNthOccurrenceInBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,2,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,0,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,1,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,2,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,3,0)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,4,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,5,1)

< 1ms

✔ FindOccurrenceOfCharInBWT_IsCorrect (a$bcacc,$,6,2)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,1,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,0,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,3,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,4,0)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,2,1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,5,1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWT_IsCorrect (a$bcacc,$,6,2)

< 1ms

✔ FindOccurrenceOfCharInSortedBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,-1)

< 1ms

✔ FindOccurrenceOfCharInSortedBWTAndSortedBWT_ThrowsExceptionOnInvalidInput (a$bca,$,10)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,0,8)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,1,9)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,2,4)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,3,1)

< 1ms

✔ LastToFirst_IsCorrect (ssncuociun$o,$,4,10)

< 1ms

Test run details

All Results