function findRelevantConnectedProperties( node, allProperties, visitedNodes ){
	    var connectedProperties = [],
	      property,
	      i,
	      l;

	    for ( i = 0, l = allProperties.length; i < l; i++ ) {
	      property = allProperties[i];
	      if ( property.domain() === node ||
	        property.range() === node ) {

	        connectedProperties.push(property);


	        /* Special case: SuperClass <-(1) Subclass <-(2) Subclass ->(3) e.g. Datatype
	         * We need to find the last property recursively. Otherwise, we would remove the subClassOf
	         * property (1) because we didn't see the datatype property (3).
	         */

	        // Look only for subclass properties, because these are the relevant properties
	        if ( elementTools.isRdfsSubClassOf(property) ) {
	          var domain = property.domain();
	          visitedNodes = visitedNodes || __webpack_require__(62)();

	          // If we have the range, there might be a nested property on the domain
	          if ( node === property.range() && !visitedNodes.has(domain) ) {
	            visitedNodes.add(domain);
	            var nestedConnectedProperties = findRelevantConnectedProperties(domain, allProperties, visitedNodes);
	            connectedProperties = connectedProperties.concat(nestedConnectedProperties);
	          }
	        }
	      }
	    }

	    return connectedProperties;
	  }
/**
	   * Looks recursively for connected properties. Because just subclasses are relevant,
	   * we just look recursively for their properties.
	   *
	   * @param node
	   * @param allProperties
	   * @param visitedNodes a visited nodes which is used on recursive invocation
	   * @returns {Array}
	   */
Looks recursively for connected properties. Because just subclasses are relevant,
we just look recursively for their properties.

@param node
@param allProperties
@param visitedNodes a visited nodes which is used on recursive invocation
@returns {Array}
Looks recursively for connected properties . Because just subclasses are relevant we just look recursively for their properties . @param node @param allProperties @param visitedNodes a visited nodes which is used on recursive invocation @returns { Array }
function findRelevantConnectedProperties( node, allProperties, visitedNodes ){
	    var connectedProperties = [],
	      property,
	      i,
	      l;
	    for ( i = 0, l = allProperties.length; i < l; i++ ) {
	      property = allProperties[i];
	      if ( property.domain() === node ||
	        property.range() === node ) {
	        connectedProperties.push(property);
	        if ( elementTools.isRdfsSubClassOf(property) ) {
	          var domain = property.domain();
	          visitedNodes = visitedNodes || __webpack_require__(62)();
	          if ( node === property.range() && !visitedNodes.has(domain) ) {
	            visitedNodes.add(domain);
	            var nestedConnectedProperties = findRelevantConnectedProperties(domain, allProperties, visitedNodes);
	            connectedProperties = connectedProperties.concat(nestedConnectedProperties);
	          }
	        }
	      }
	    }
	    return connectedProperties;
	  }
function findRelevantConnectedProperties ( node , allProperties , visitedNodes ) { var connectedProperties = [ ] , property , i , l ; for ( i = 0 , l = allProperties . length ; i < l ; i ++ ) { property = allProperties [ i ] ; if ( property . domain ( ) === node || property . range ( ) === node ) { connectedProperties . push ( property ) ; if ( elementTools . isRdfsSubClassOf ( property ) ) { var domain = property . domain ( ) ; visitedNodes = visitedNodes || __webpack_require__ ( 62 ) ( ) ; if ( node === property . range ( ) && ! visitedNodes . has ( domain ) ) { visitedNodes . add ( domain ) ; var nestedConnectedProperties = findRelevantConnectedProperties ( domain , allProperties , visitedNodes ) ; connectedProperties = connectedProperties . concat ( nestedConnectedProperties ) ; } } } } return connectedProperties ; }
Looks recursively for connected properties.
Looks recursively for connected properties .
/* Special case: SuperClass <-(1) Subclass <-(2) Subclass ->(3) e.g. Datatype
	         * We need to find the last property recursively. Otherwise, we would remove the subClassOf
	         * property (1) because we didn't see the datatype property (3).
	         */ // Look only for subclass properties, because these are the relevant properties // If we have the range, there might be a nested property on the domain