Erdos

Getting Started
Graph Types
Basic Interface
Edge And Vertex Maps
Network Types
Property Interface for Networks
Operators
Traversals
Distance
Shortest Paths
Linear Algebra
Reading / Writing Graphs
Graph Datasets
Deterministic Graphs
Random Graphs
Centrality Measures
Community Structures
Flow and Cut
Matching
Dismantling
Spanning Trees

Version

Matching

Matching

Edit on GitHub

Matching

Algorithms for the optimal matching problems. Functionalities moved to ErdosExtras.jl.

« Flow and Cut Dismantling »

Powered by Documenter.jl and the Julia Programming Language.

Settings

Theme

This document was generated with Documenter.jl on Monday 27 September 2021. Using Julia version 1.6.3.