How to check if there is an edge between two nodes in an undirected graph?

How can I check if any two nodes in an undirected graph are connected via an edge or not, please? in other words, Are they neighbors or not? Thanks!

Answer 1

[Christine Tobler]

Call findedge(g, node1, node2). If there is no edge connecting these nodes, the output is zero. Otherwise, the output is the index into the Edges table of the connecting edge.

[Waseem AL Aqqad]

Thank you so much, Christine!

Answer 2

[Pratibha Chaudhary]

findedge(g, node1, node2).