This article provides information on adjacent graph element functions. Adjacent graph elements are elements that are directly connected to other such elements by at least one edge. You can create sets of nodes or edges from adjacent elements, count these elements or check wether they are adjacent. For the general structure of function syntax have a look at this article.

### Table of adjacent graph element functions

The table contains a column with the function syntax on the left, as well as an explanation column on the right.

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

adjacent(Node[,EdgeClass[,NodeClass]]):set | Looks for all nodes of class NodeClass connected by edges of class EdgeClass to the "Node" and returns a set of nodes |

adjacentIncoming (Node[,EdgeClass[,NodeClass]]):set | Looks for all nodes of class NodeClass connected by incoming edges of class EdgeClass to the "Node" and returns a set of nodes |

adjacentOutgoing (Node[,EdgeClass[,NodeClass]]):set | Looks for all nodes of class NodeClass connected by outgoing edges of class EdgeClass to the "Node" and returns a set of nodes with these nodes |

incident(Node[,EdgeClass[,NodeClass]]):set | Looks for all edges of class EdgeClass connecting the node with nodes of class NodeClass and returns a set of edges with these edges |

incoming(Node[,EdgeClass[,NodeClass]]):set | Looks for all incoming edges of class EdgeClass connecting the node with nodes of class NodeClass and returns a set of edges with these edges |

outgoing(Node[,EdgeClass[,NodeClass]]):set | Looks for all outgoing edges of class EdgeClass connecting the node with nodes of class NodeClass and returns a set of edges with these edges |

countAdjacent(Node[,EdgeClass[,NodeClass]]):int | Count the adjacent nodes of class NodeClass connected by edges of class EdgeClass with the "Node" and save it as a integer |

countAdjacentIncoming (Node[,EdgeClass[,NodeClass]]):int | Count the adjacent nodes of class NodeClass connected by incoming edges of class EdgeClass with the "Node" and save it as a integer |

countAdjacentOutgoing (Node[,EdgeClass[,NodeClass]]):int | Count the adjacent nodes of class NodeClass connected by outgoing edges of class EdgeClass with the "Node" and save it as a integer |

countIncident(Node[,EdgeClass[,NodeClass]]):int | Count the edges of class EdgeClass that connect the "Node" with nodes of class "NodeClass" and save it as a integer |

countIncoming(Node[,EdgeClass[,NodeClass]]):int | Count the incoming edges of class EdgeClass that connect the "Node" with nodes of class "NodeClass" and save it as a integer |

countOutgoing(Node[,EdgeClass[,NodeClass]]):int | Count the outgoing edges of class EdgeClass that connect the "Node" with nodes of class "NodeClass" and save it as a integer |

isAdjacent (Node,Node[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the two "Node" arguments are connected with each other by edges of class EdgeClass and are of class NodeClass |

isAdjacentIncoming (Node,Node[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the first "Node" argument is connected with an incoming edge of class EdgeClass with the second "Node" argument |

isAdjacentOutgoing (Node,Node[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the first "Node" argument is connected with an outgoing edge of class EdgeClass with the second "Node" argument |

isIncident (Node,Edge[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the "Node" is of class NodeClass and is connected to an edge of class EdgeClass |

isIncoming (Node,Edge[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the "Node" is of class NodeClass and is connected to an incoming edge of class EdgeClass |

isOutgoing (Node,Edge[,EdgeClass[,NodeClass]]):boolean | Sets a boolean variable true, when the "Node" is of class NodeClass and is connected to an outgoing edge of class EdgeClass |

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