IndexedGraph

IndexedGraph{T<:Integer} <: AbstractIndexedGraph{T}

A type representing a sparse undirected graph.

FIELDS

• A – square adjacency matrix. A[i,j] == A[j,i] contains the unique index associated to unidrected edge (i,j)

IndexedGraph(A::AbstractMatrix)

Construct an IndexedGraph from symmetric adjacency matrix A.

inedges(g::IndexedGraph, i::Integer)

Return a lazy iterators to the edges incident to i with i as the destination.

outedges(g::IndexedGraph, i::Integer)

Return a lazy iterators to the edges incident to i with i as the source.

get_edge(g::IndexedGraph, src::Integer, dst::Integer)
get_edge(g::IndexedGraph, id::Integer)

Get edge given source and destination or given edge index.

edges(g::IndexedGraph, i::Integer)

Return a lazy iterators to the edges incident to i.

By default unordered edges sort source and destination nodes in increasing order. See outedges and inedges if you need otherwise.