petgraph/petgraph
Petgraph
petgraph is a graph data structure library for the Rust programming language. It provides a collection of tools for representing and manipulating graphs, functioning as a network analysis tool and a comprehensive graph algorithm suite.
The library integrates with Graphviz DOT for importing, exporting, and parsing graph data to facilitate visualization. It distinguishes itself by offering specialized network analysis capabilities, such as the detection of cliques, bridge edges, articulation points, and subgraph isomorphisms.
Its computational surface covers a wide range of algorithms, including shortest path calculations, network flow analysis, minimum spanning tree computation, and topological node sorting. The library also supports synthetic graph generation for simulation and testing, as well as graph component filtering to create virtual views of data.
The implementation uses index-based node referencing and adjacency-list representations to manage graph connectivity and memory optimization.
Features
- Graph Analysis Algorithms - Provides a comprehensive suite of core graph theory algorithms for analyzing connectivity and structure.
- Graph Data Structures - Provides a comprehensive collection of graph data structures and algorithms for the Rust language.
- Graph Pattern Detection - Locates cliques, bridge edges, articulation points, and subgraph isomorphisms within a network.
- Network Analysis - Implements advanced algorithms for detecting cliques, bridge edges, articulation points, and subgraph isomorphisms.
- Graph Data Structure Management - Provides efficient internal data structures for representing and manipulating complex graph relationships.
- Stable Index Mappings - Maintains consistent node and edge identifiers across removals by tracking holes in storage arrays.
- Adjacency Lists - Implements graph connectivity using adjacency lists for efficient traversal and edge lookups.
- Index-Based Referencing - Uses integer indices instead of pointers to identify nodes and edges for better memory locality.
- Network Flow Algorithms - Determines the maximum flow in a network using optimized flow algorithms.
- Shortest Path Algorithms - Implements algorithms for finding the most efficient routes and connectivity patterns in networks.
- Topological Ordering Algorithms - Provides algorithms to organize nodes in a directed graph based on dependency constraints.
- Graph Algorithm Routines - Provides a comprehensive suite of routines for shortest paths, minimum spanning trees, and maximum flow calculations.
- Graph Abstractions - Defines common graph behaviors via generic interfaces to allow different internal storage layouts.
- Edge Weight Storage - Associates numeric values with edges to enable the execution of pathfinding and minimum spanning tree algorithms.
- Minimum Spanning Tree Algorithms - Identifies the subset of edges connecting all vertices with the minimum total edge weight.
- Shortest Path Algorithms - Computes the most efficient route between nodes using weighted and unweighted pathfinding algorithms.
- Topological Sorting - Determines a linear ordering of nodes in a directed acyclic graph to satisfy dependencies.
- Graph Format Exporters - Exports graph data into formats compatible with Graphviz for visual rendering and plotting.
- Graphviz-Based Graph Renderers - Provides a workflow for rendering internal graph structures as DOT files for visual debugging.
- Graphviz DOT Emitters - Converts internal graph representations into Graphviz DOT strings for external visualization.
- DOT Graph Generation - Converts internal graph structures into Graphviz DOT format for external rendering.
- Graphviz DOT Integrations - Integrates importing, exporting, and parsing of graph data using the Graphviz DOT language.
- Graph Format Importers - Reads graph structures from DOT and other standard file formats into usable internal data.
- Synthetic Graph Generation - Implements synthetic graph generation based on mathematical models for network simulation and testing.
- Graph Filtering - Creates virtual views of a graph by removing nodes or edges based on specific criteria.
- DOT - Parses Graphviz DOT language scripts to reconstruct internal graph data structures.
