#NEWLINE# def test_can_bidi_match_start_node_and_type( self ) : #NEWLINE# #INDENT# relationships = list ( self . graph . match ( start_node = self . bob , rel_type = 'KNOWS' , bidirectional = True ) ) #NEWLINE# assert ( len ( relationships ) == 4 ) #NEWLINE# assert ( self . alice in [ rel . start_node ( ) for rel in relationships ] ) #NEWLINE# assert ( self . bob in [ rel . start_node ( ) for rel in relationships ] ) #NEWLINE# assert ( self . carol in [ rel . start_node ( ) for rel in relationships ] ) #NEWLINE# assert ( self . alice in [ rel . end_node ( ) for rel in relationships ] ) #NEWLINE# assert ( self . bob in [ rel . end_node ( ) for rel in relationships ] ) #NEWLINE# assert ( self . carol in [ rel . end_node ( ) for rel in relationships ] )