Graphs.jl
stable
  • Main Features
  • Generic Interfaces
  • Vertices and Edges
  • Graph Types
  • Graph Algorithms
  • Matrix Representation
  • Graph Generators
  • Examples
 
Graphs.jl
  • Docs »
  • Welcome to Graphs.jl’s documentation!
  • Edit on GitHub

Welcome to Graphs.jl’s documentation!¶

Graphs.jl is a Julia package that provides graph types and algorithms. The design of this package is inspired by the Boost Graph Library (e.g. using standardized generic interfaces), while taking advantage of Julia’s language features (e.g. multiple dispatch).

Contents¶

  • Main Features
  • Generic Interfaces
    • Basic interface
    • Vertex List interface
    • Edge List interface
    • Vertex Map interface
    • Edge Map interface
    • Adjacency List interface
    • Incidence List interface
    • Bidirectional Incidence List interface
    • Interface declaration and verification
  • Vertices and Edges
    • Vertex Types
    • Edge Types
    • Edge Properties
  • Graph Types
    • Edge List
    • Adjacency List
    • Incidence List
    • Graph
  • Graph Algorithms
    • Graph Traversal
    • Cycle detection
    • Connected components
    • Cliques
    • Topological Sorting
    • Shortest Paths
    • Minimum Spanning Trees
    • Flow
    • Random Graphs
  • Matrix Representation
    • Adjacency Matrix
    • Weight Matrix
    • Distance Matrix
    • Laplacian Matrix
  • Graph Generators
  • Examples

Indices and tables¶

  • Index
  • Search Page
Next

© Copyright 2013, Dahua Lin and contributors to the package.. Revision 410d1190c783c860e3b4d23786e94aa328f33513.

Built with Sphinx using a theme provided by Read the Docs.
Read the Docs v: stable
Versions
latest
stable
Downloads
pdf
htmlzip
epub
On Read the Docs
Project Home
Builds

Free document hosting provided by Read the Docs.