SimpleWeightedGraphs

Quick start

This package defines two new graph types: SimpleWeightedGraph and SimpleWeightedDiGraph. See the tutorial to discover what you can do with them. Also refer to the Graphs.jl package for more complex algorithms.

Caveats

Because SimpleWeighted(Di)Graphs are stored in sparse matrices, they have two major flaws:

Iteratively adding or removing vertices or edges is not very efficient. Building the graph in one go from a list of edge sources, destinations and weights is much faster.
Zero-weight edges are discarded by add_edge!. A possible workaround is to set a very small weight instead.

In additions, self-loops are not supported.

Alternatives

If your graphs have more than just edge weights to store, take a look at MetaGraphsNext.jl or MetaGraphs.jl for more complex formats.