This article lists all global functions for reachable graph elements in a table. Reachable graph elements are elements that can be reached from a starting node or starting edge by one or more edges. It’s possible to create sets of nodes or edges from these elements, count the elements or check whether they are reachable (boolean). Besides a column with the syntax of the function a short explanation is given in the second column. For the general structure of the global function syntax have a look at this article.

### Table of reachable functions

Syntax | Description |
---|---|

reachable (Node[,EdgeClass[,NodeClass]]):set | Create a set of nodes that can be reached from a start "Node" using edges of type "EdgeClass" and passing and counting only nodes of type "NodeClass" |

reachableIncoming (Node[,EdgeClass[,NodeClass]]):set | Create a set of nodes that can be reached from a start "Node" using incoming edges of type "EdgeClass" and passing and counting only nodes of type "NodeClass" |

reachableOutgoing (Node[,EdgeClass[,NodeClass]]):set | Create a set of nodes that can be reached from a start "Node" using outgoing edges of type "EdgeClass" and passing and counting only nodes of type "NodeClass" |

reachableEdges (Node[,EdgeClass[,NodeClass]]):set | Create a set of edges that can be reached from a start "Node" using and counting only edges of type "EdgeClass" and passing only nodes of type "NodeClass" |

reachableEdgesIncoming (Node[,EdgeClass[,NodeClass]]):set | Create a set of edges that can be reached from a start "Node" using and counting only incoming edges of type "EdgeClass" and passing only nodes of type "NodeClass" |

reachableEdgesOutgoing (Node[,EdgeClass[,NodeClass]]):set | Create a set of edges that can be reached from a start "Node" using and counting only outgoing edges of type "EdgeClass" and passing only nodes of type "NodeClass" |

boundedReachable (Node,int[,EdgeClass[,NodeClass]]):set | Looks for all nodes of class NodeClass that can be reached in "int" steps by edges of class EdgeClass from the "Node" and returns a set of these nodes |

boundedReachableIncoming (Node,int[,EdgeClass[,NodeClass]]):set | Looks for all incoming nodes of class NodeClass that can be reached in "int" steps by edges of class EdgeClass from the "Node" and returns a set of these nodes |

boundedReachableOutgoing (Node,int[,EdgeClass[,NodeClass]]):set | Looks for all outgoing nodes of class NodeClass that can be reached in "int" steps by edges of class EdgeClass from the "Node" and returns a set of these nodes |

boundedReachableEdges (Node,int[,EdgeClass[,NodeClass]]):set | Looks for all edges of class EdgeClass that are reachable in "int" steps from the node "Node" while connecting the node with nodes of class NodeClass and returns a set of these edges |

boundedReachableEdgesIncoming (Node,int[,EdgeClass[,NodeClass]]):set | Looks for all incoming edges of class EdgeClass that are reachable in "int" steps from the node "Node" while connecting the node with nodes of class NodeClass and returns a set of these edges |

boundedReachableEdgesOutgoing (Node,int[,EdgeClass[,NodeClass]]):set | Looks for all outoging edges of class EdgeClass that are reachable in "int" steps from the node "Node" while connecting the node with nodes of class NodeClass and returns a set of these edges |

boundedReachableWithRemainingDepth (Node,int):map | Looks for all nodes that can be reached in "int" steps from the "Node" and returns the map of nodes and the minimum amount of steps to reach the corresponding node |

boundedReachableWithRemainingDepthIncoming (Node,int):map | Looks for all nodes that can be reached in "int" steps from the "Node" by incoming edges and returns the map of nodes and the minimum amount of steps to reach the corresponding node |

boundedReachableWithRemainingDepthOutgoing (Node,int):map | Looks for all nodes that can be reached in "int" steps from the "Node" by outgoing edges and returns the map of nodes and the minimum amount of steps to reach the corresponding node |

countReachable (Node[,EdgeClass[,NodeClass]]):int | Count the reachable nodes of class NodeClass from the "Node" by edges of class EdgeClass and save it as a integer |

countReachableIncoming (Node[,EdgeClass[,NodeClass]]):int | Count the reachable nodes of class NodeClass from the "Node" by incoming edges of class EdgeClass and save it as a integer |

countReachableOutgoing (Node[,EdgeClass[,NodeClass]]):int | Count the reachable nodes of class NodeClass from the "Node" by outgoing edges of class EdgeClass and save it as a integer |

countReachableEdges (Node[,EdgeClass[,NodeClass]]):int | Count the edges of class EdgeClass that are reachable from the "Node" while connecting the "Node" only with nodes of class NodeClass and save it as a integer |

countReachableEdgesIncoming (Node[,EdgeClass[,NodeClass]]):int | Count the incoming edges of class EdgeClass that are reachable from the "Node" while connecting the "Node" only with nodes of class NodeClass and save it as a integer |

countReachableEdgesOutgoing (Node[,EdgeClass[,NodeClass]]):int | Count the outgoing edges of class EdgeClass that are reachable from the "Node" while connecting the "Node" only with nodes of class NodeClass and save it as a integer |

countBoundedReachable (Node,int[,EdgeClass[,NodeClass]]):int | Count the nodes of class NodeClass reachable from the "Node" in max. "int" steps by edges of class EdgeClass and save it as a integer |

countBoundedReachableIncoming (Node,int[,EdgeClass[,NodeClass]]):int | Count the nodes of class NodeClass reachable from the "Node" in max. "int" steps by incoming edges of class EdgeClass and save it as a integer |

countBoundedReachableOutgoing (Node,int[,EdgeClass[,NodeClass]]):int | Count the nodes of class NodeClass reachable from the "Node" in max. "int" steps by outgoing edges of class EdgeClass and save it as a integer |

countBoundedReachableEdges (Node,int[,EdgeClass[,NodeClass]]):int | Count the edges of class EdgeClass that are reachable from the "Node" in max. "int" steps while connecting the "Node" only with nodes of class NodeClass and save it as a integer |

countBoundedReachableEdgesIncoming (Node,int[,EdgeClass[,NodeClass]]):int | Count the incoming edges of class EdgeClass that are reachable from the "Node" in max. "int" steps while connecting the "Node" only with nodes of class NodeClass and save it as a integer |

countBoundedReachableEdgesOutgoing (Node,int[,EdgeClass[,NodeClass]]):int | Count the outgoing edges of class EdgeClass that are reachable from the "Node" in max. "int" steps while connecting the "Node" only with nodes of class NodeClass and save it as a integer |

isReachable (Node,Node[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the second "Node" argument of class NodeClass is reachable from the first "Node" argument by edges of class EdgeClass |

isReachableIncoming (Node,Node[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the second "Node" argument of class NodeClass is reachable from the first "Node" argument by incoming edges of class EdgeClass |

isReachableOutgoing (Node,Node[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the second "Node" argument of class NodeClass is reachable from the first "Node" argument by outgoing edges of class EdgeClass |

isReachableEdges (Node,Edge[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the edge of class EdgeClass is reachable from the "Node" of class NodeClass |

isReachableEdgesIncoming (Node,Edge[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the edge of class EdgeClass is reachable from the "Node" of class NodeClass by only incoming edges |

isReachableEdgesOutgoing (Node,Edge[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the edge of class EdgeClass is reachable from the "Node" of class NodeClass by only outgoing edges |

isBoundedReachable (Node,Node,int[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the second "Node" argument of class NodeClass is reachable in max "int" steps from the first "Node" argument by edges of class EdgeClass |

isBoundedReachableIncoming (Node,Node,int[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the second "Node" argument of class NodeClass is reachable in max "int" steps from the first "Node" argument by incoming edges of class EdgeClass |

isBoundedReachableOutgoing (Node,Node,int[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the second "Node" argument of class NodeClass is reachable in max "int" steps from the first "Node" argument by outgoing edges of class EdgeClass |

isBoundedReachableEdges (Node,Edge,int[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the edge of class EdgeClass is reachable in max "int" steps from the "Node" of class NodeClass |

isBoundedReachableEdgesIncoming (Node,Edge,int[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the edge of class EdgeClass is reachable in max "int" steps from the "Node" of class NodeClass by only incoming edges |

isBoundedReachableEdgesOutgoing (Node,Edge,int[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the edge of class EdgeClass is reachable in max "int" steps from the "Node" of class NodeClass by only outgoing edges |

If you couldn’t find the right function for your needs, have a look at the other functions in this article.