network programming - Directed Graphs in Julia, need some function like "has_edge" -


i have initialize directed graph in julia , searching procedure testing, if node has specific neighbour.

in python have graph class can call function like:
directedgraph.has_edge(i, j) -> true if , j connected

i have not found s.th. similar in julia. can show me way, how implement in julia? using graphs.jl, think extensively package.

just wanted follow here - has_edge exists in lightgraphs.jl both directed , undirected graphs.

edited add: of post, graphs.jl has been moved "juliaarchive" organization indicating development has stagnated. lightgraphs.jl preferred graphs package julia.


Comments

Popular posts from this blog

c++ - No viable overloaded operator for references a map -

java - Custom OutputStreamAppender not run: LOGBACK: No context given for <MYAPPENDER> -

java - Cannot secure connection using TLS -