Graph Theory Packages
-
NetworkDynamics.jl123Julia package for simulating Dynamics on Networks
-
LightGraphs.jl671An optimized graphs package for the Julia programming language
-
AbstractTrees.jl200Abstract julia interfaces for working with trees
-
BlockArrays.jl194BlockArrays for Julia
-
ContinuumArrays.jl27A package for representing quasi arrays with continuous indices
-
Graphs.jl457An optimized graphs package for the Julia programming language
-
SuiteSparseGraphBLAS.jl103Sparse, General Linear Algebra for Graphs!
-
MolecularGraph.jl195Graph-based molecule modeling toolkit for cheminformatics
-
PositiveFactorizations.jl38Positive-definite "approximations" to matrices
-
MetaGraphsNext.jl73A package for graphs with vertex labels and metadata in Julia
-
RepresentationTheory.jl29-
-
GeometricFlux.jl348Geometric Deep Learning for Flux
-
Flow.jl122-
-
XGBoost.jl288XGBoost Julia Package
-
OffsetArrays.jl195Fortran-like arrays with arbitrary, zero or negative starting indices.
-
FunctionalCollections.jl123Functional and persistent data structures for Julia
-
GraphPlot.jl201Graph visualization for Julia.
-
MatrixNetworks.jl109Graph and Network algorithms in Julia
-
PDMats.jl104Uniform Interface for positive definite matrices of various structures
-
GraphRecipes.jl164Graph-related recipes to be used with Plots.jl
-
SimpleWeightedGraphs.jl37Edge-weighted graphs compatible with Graphs.jl
-
Sims.jl112Equation-based modeling and simulations in Julia
-
Arrowhead.jl11Arrowhead and DPR1 eigenvalues
-
MultilayerGraphs.jl118A Julia package for the creation, manipulation and analysis of the structure, dynamics and functions of multilayer graphs.
-
Laplacians.jl215Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.
-
SimpleHypergraphs.jl75A simple hypergraphs package for the Julia programming language
-
NetworkLayout.jl97Layout algorithms for graphs and trees in pure Julia.
-
GraphIO.jl61Graph IO functionality for various formats.
-
LayeredLayouts.jl36Layered Layout Algorithms for Directed Acyclic Graphs
-
MetaGraphs.jl58Graph data structures with multiple heterogeneous metadata for Graphs.jl.
-
SpatialGraphs.jl12Types and constructors for spatially referenced graphs.
-
SimpleGraphs.jl38Convenient way to handle simple graphs and digraphs
-
EvolvingGraphs.jl52Working with time-dependent networks in Julia
-
Multigraphs.jl31A multigraph extension of Graphs.jl
-
RobustShortestPath.jl18Julia package for finding robust shortest paths
-
LightGraphsExtras.jl21Additional functionality for LightGraphs.jl
-
TSPSubgradient.jl2A TSP approximation with the subgradient method.
-
SNAPDatasets.jl16LightGraphs.jl-formatted graph files taken from the SNAP Datasets collection.
-
MinimalPerfectHashes.jl16An implementation of minimal perfect hash function generation as described in Czech et. al. 1992.
-
Networks.jl4A library for working with Graphs in Julia.
Loading more...