Interface

addnode!(graph) -> Int
addnode!(graph, attr) -> Int

Add new node and return the node index. If the node attribute type is required, specify the node attribute object by node keyword.

clearcache!(graph::AbstractGraph) -> nothing

Clear calculated property caches.

Calling clearcache! is recommended when the graph nodes/edges are added, removed or reindexed. You can Graph.clone the graph before destructive operation instead.

clone(graph::AbstractGraph) -> AbstractGraph

Return deep copy of the graph.

edgeattr(graph::AbstractGraph, u::Int, v::Int
    ) -> Union{AbstractEdge,Nothing}

Return the attribute object of an edge that connects u and v. If not found, return nothing.

edgeattr(graph::AbstractGraph, i::Int) -> AbstractEdge

Return the attribute object of edge i.

edgeattrs(graph::Union{OrderedGraph,OrderedDiGraph}) -> Vector{AbstractEdge}

Return graph edge attributes.

edgeattrtype(graph) -> Type

Return edge attribute type.

edgecount(graph::AbstractGraph) -> Int

Return the number of graph edges.

edgeset(graph::Union{OrderedGraph,OrderedDiGraph}) -> Set{Int}

Return the set of edge keys.

getedge(graph::AbstractGraph, i::Int) -> Tuple{Int,Int}
getedge(graph::HyperGraph, i::Int) -> Set{Int}

Return an edge.

hasedge(graph::UndirectedGraph, u::Int, v::Int) -> Bool
hasedge(graph::DirectedGraph, source::Int, target::Int) -> Bool

Return whether the given two nodes are connected by at least one edge.

indegree(graph::DirectedGraph, n::Int) -> Int

Return the number of inneighbors of the node 'n'.

inneighbors(graph::DirectedGraph, i::Int) -> Dict{Int,Int}

Return the mapping of predecessor node keys and in edge keys connected to the given node.

neighborcount(graph::AbstractGraph, n::Int) -> Int
degree(graph::AbstractGraph, n::Int) -> Int

Return the number of adjacent nodes of the node 'n'.

neighbors(graph, i) -> Dict{Int,Int}

Return the mapping of incident edges and adjacent nodes of node i. If the graph is directed graph, both outneighbors and inneighbors are mapped.

nodeattr(graph::AbstractGraph, i::Int) -> AbstractNode

Return the attribute object of node i.

nodeattrs(graph::Union{OrderedGraph,OrderedDiGraph}) -> Vector{AbstractNode}

Return graph node attributes.

nodeattrtype(graph) -> Type

Return node attribute type.

nodecount(graph::AbstractGraph) -> Int

Return the number of graph nodes.

nodeset(graph::Union{OrderedGraph,OrderedDiGraph}) -> Set{Int}

Return the set of node keys.

outdegree(graph::DirectedGraph, n::Int) -> Int

Return the number of outneighbors of the node 'n'.

outneighbors(graph::DirectedGraph, i::Int) -> Dict{Int,Int}

Return the mapping of successor node keys and out edge keys connected to the given node.

setedgeattr!(graph::AbstractGraph, i::Int, attr::AbstractNode)

Update the edge attribute.

setnodeattr!(graph::AbstractGraph, i::Int, attr::AbstractNode)

Update the node attribute.

unlinkedges(graph, edges)

Delete given edges from the graph.

unlinknodes(graph, nodes)

Delete given nodes and its incident edges from the graph.