Skip to main content

problemreductions/topology/
mod.rs

1//! Graph topology types.
2//!
3//! - [`SimpleGraph`]: Standard unweighted graph (default for most problems)
4//! - [`PlanarGraph`]: Planar graph
5//! - [`BipartiteGraph`]: Bipartite graph
6//! - [`DirectedGraph`]: Directed graph (digraph)
7//! - [`MixedGraph`]: Mixed graph with directed arcs and undirected edges
8//! - [`UnitDiskGraph`]: Vertices with 2D positions, edges based on distance
9//! - [`KingsSubgraph`]: 8-connected grid graph (King's graph)
10//! - [`TriangularSubgraph`]: Triangular lattice subgraph
11//! - [`DirectedGraph`]: Directed graph (for problems like `MinimumFeedbackVertexSet`)
12
13mod bipartite_graph;
14mod directed_graph;
15mod graph;
16mod kings_subgraph;
17mod mixed_graph;
18mod path;
19mod planar_graph;
20pub mod small_graphs;
21mod triangular_subgraph;
22mod unit_disk_graph;
23
24pub use bipartite_graph::BipartiteGraph;
25pub use directed_graph::DirectedGraph;
26pub use graph::{Graph, SimpleGraph};
27pub use kings_subgraph::KingsSubgraph;
28pub use mixed_graph::MixedGraph;
29pub(crate) use path::is_simple_st_path;
30pub use planar_graph::PlanarGraph;
31pub use small_graphs::{available_graphs, smallgraph};
32pub use triangular_subgraph::TriangularSubgraph;
33pub use unit_disk_graph::UnitDiskGraph;