All Projects → JuliaGraphs → Graphs.jl

JuliaGraphs / Graphs.jl

Licence: other
An optimized graphs package for the Julia programming language

Programming Languages

julia
2034 projects

Projects that are alternatives of or similar to Graphs.jl

jgrapht
Master repository for the JGraphT project
Stars: ✭ 2,259 (+1046.7%)
Mutual labels:  datastructures, graph-algorithms, graphs, graph-theory
Differentia.js
No longer being supported or maintained. A Graph Theory & Data Structure Library for JavaScript.
Stars: ✭ 13 (-93.4%)
Mutual labels:  datastructures, graph-algorithms, graph-theory
kaliningraph
🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
Stars: ✭ 62 (-68.53%)
Mutual labels:  graph-algorithms, graphs, graph-theory
LightGraphs.jl
An optimized graphs package for the Julia programming language
Stars: ✭ 680 (+245.18%)
Mutual labels:  graph-algorithms, graph-theory, graph-analytics
gardenia
GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators
Stars: ✭ 22 (-88.83%)
Mutual labels:  graph-algorithms, graph-analytics
SuiteSparseGraphBLAS.jl
Sparse, General Linear Algebra for Graphs!
Stars: ✭ 79 (-59.9%)
Mutual labels:  graphs, graph-analytics
mully
R package to create, modify and visualize graphs with multiple layers.
Stars: ✭ 36 (-81.73%)
Mutual labels:  graphs, graph-theory
networkx-guide
We here are very big fans of NetworkX as a graph library and its comprehensive set of graph algorithms. For many though, working with NetworkX involves a steep learning curve. This guide is designed as an aid for beginners and experienced users to find specific tips and explore the world of complex networks.
Stars: ✭ 28 (-85.79%)
Mutual labels:  graph-algorithms, graph-theory
GraphIO.jl
Graph IO functionality for various formats.
Stars: ✭ 54 (-72.59%)
Mutual labels:  graphs, juliagraphs
Erdos.jl
A library for graph analysis written Julia.
Stars: ✭ 37 (-81.22%)
Mutual labels:  graph-algorithms, graphs
Graph-Algorithms
Everything you need to know about graph theory to ace a technical interview 🔥
Stars: ✭ 87 (-55.84%)
Mutual labels:  graph-algorithms, graph-theory
gcnn keras
Graph convolution with tf.keras
Stars: ✭ 47 (-76.14%)
Mutual labels:  graph-algorithms, graphs
jsgraph
Deprecated: Use the @encapsule/arccore package that includes the graph library
Stars: ✭ 42 (-78.68%)
Mutual labels:  graph-algorithms, graph-theory
Causing
Causing: CAUsal INterpretation using Graphs
Stars: ✭ 47 (-76.14%)
Mutual labels:  graphs, graph-theory
graphs
Graph algorithms written in Go
Stars: ✭ 60 (-69.54%)
Mutual labels:  graph-algorithms, graph-theory
StaticGraphs.jl
Memory-efficient immutable LightGraphs.
Stars: ✭ 33 (-83.25%)
Mutual labels:  graphs, juliagraphs
Advanced-Shortest-Paths-Algorithms
Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
Stars: ✭ 63 (-68.02%)
Mutual labels:  graph-algorithms, graphs
Grafatko
An app for creating and visualizing graphs and graph-related algorithms.
Stars: ✭ 22 (-88.83%)
Mutual labels:  graph-algorithms, graph-theory
pgx-samples
Applications using Parallel Graph AnalytiX (PGX) from Oracle Labs
Stars: ✭ 39 (-80.2%)
Mutual labels:  graph-algorithms, graph-analytics
graphi
🌠 An interactive network analysis & visualization tool
Stars: ✭ 20 (-89.85%)
Mutual labels:  graph-theory, graph-analytics

Graphs.jl

Build Status codecov.io

Overview

The goal of Graphs.jl is to offer a performant platform for network and graph analysis in Julia, following the example of libraries such as NetworkX in Python. To this end, Graphs.jl offers:

  • a set of simple, concrete graph implementations -- SimpleGraph (for undirected graphs) and SimpleDiGraph (for directed graphs)
  • an API for the development of more sophisticated graph implementations under the AbstractGraph type
  • a large collection of graph algorithms with the same requirements as this API.

Installation

Installation is straightforward. First, enter Pkg mode by hitting ], and then run the following command:

pkg> add Graphs

Basic use

Graphs.jl includes numerous convenience functions for generating functions, such as path_graph, which builds a simple undirected path graph of a given length. Once created, these graphs can be easily interrogated and modified.

julia> g = path_graph(6)
{6, 5} undirected simple Int64 graph

# Number of vertices
julia> nv(g)
6

# Number of edges
julia> ne(g)
5

# Add an edge to make the path a loop
julia> add_edge!(g, 1, 6);

Documentation

The full documentation is available at GitHub Pages. Documentation for methods is also available via the Julia REPL help system. Additional tutorials can be found at JuliaGraphsTutorials.

Citing

We encourage you to cite our work if you have used our libraries, tools or datasets. Starring the Graphs.jl repository on GitHub is also appreciated.

The latest citation information may be found in the CITATION.bib file within the repository.

Contributing

We welcome contributions and bug reports! Please see CONTRIBUTING.md for guidance on development and bug reporting.

JuliaGraphs development subscribes to the Julia Community Standards.

Related packages

It is an explicit design decision that any data not required for graph manipulation (attributes and other information, for example) is expected to be stored outside of the graph structure itself.

Additional functionality like advanced IO and file formats, weighted graphs, property graphs, and optimization-related functions can be found in the packages of the JuliaGraphs organization.

Project status

The Graphs.jl project is a reboot of the LightGraphs.jl package (archived in October 2021), which remains available on GitHub at sbromberger/LightGraphs.jl. If you don't need any new features developed since the fork, you can continue to use older versions of LightGraphs.jl indefinitely. New versions will be released here using the name Graphs.jl instead of LightGraphs.jl. There was an older package also called Graphs.jl. The source history and versions are still available in this repository, but the current code base is unrelated to the old Graphs.jl code and is derived purely from LightGraphs.jl. To access the history of the old Graphs.jl code, you can start from commit 9a25019.

Transition from LightGraphs to Graphs

LightGraphs.jl and Graphs.jl are functionally identical, still there are some steps involved making the change:

  • Change LightGraphs = "093fc24a-ae57-5d10-9952-331d41423f4d" to Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6" in your Project.toml.
  • Update your using and import statements.
  • Update your type constraints and other references to LightGraphs to Graphs.
  • Increment your version number. Following semantic versioning, we suggest a patch release when no graphs or other Graphs.jl-objects can be passed through the API of your package by those depending on it, otherwise consider it a breaking release. "Passed through" entails created outside and consumed inside your package and vice versa.
  • Tag a release.

About versions

  • The master branch of Graphs.jl is generally designed to work with versions of Julia starting from the LTS release all the way to the current stable release, except during Julia version increments as we transition to the new version.
  • Later versions: Some functionality might not work with prerelease / unstable / nightly versions of Julia. If you run into a problem, please file an issue.
  • The project was previously developed under the name LightGraphs.jl and older versions of LightGraphs.jl (≤ v1.3.5) must still be used with that name.
  • There was also an older package also called Graphs.jl (git tags v0.2.5 through v0.10.3), but the current code base here is a fork of LightGraphs.jl v1.3.5.
  • All older LightGraphs.jl versions are tagged using the naming scheme lg-vX.Y.Z rather than plain vX.Y.Z, which is used for old Graphs.jl versions (≤ v0.10) and newer versions derived from LightGraphs.jl but released with the Graphs.jl name (≥ v1.4).
  • If you are using a version of Julia prior to 1.x, then you should use LightGraphs.jl at lg-v.12.* or Graphs.jl at v0.10.3
Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].