List of all items[−]
Structs
- algo::dijkstra::BitVector
- algo::dijkstra::Dijkstra
- algo::dijkstra::EpochArray
- algo::dijkstra::EpochNodeWeightArray
- algo::traversal::AllowedNodesForbiddenSubgraph
- algo::traversal::BackwardNeighborStrategy
- algo::traversal::BfsQueueStrategy
- algo::traversal::DfsPostOrderTraversal
- algo::traversal::DfsQueueStrategy
- algo::traversal::ForbiddenEdge
- algo::traversal::ForbiddenNode
- algo::traversal::ForwardNeighborStrategy
- algo::traversal::NoForbiddenSubgraph
- algo::traversal::PreOrderTraversal
- algo::traversal::UndirectedNeighborStrategy
- algo::traversal::univocal_traversal::UnivocalIterator
- implementation::bit_vector_subgraph::BitVectorSubgraph
- implementation::incremental_subgraph::IncrementalSubgraph
- index::EdgeIndex
- index::GraphIndices
- index::NodeIndex
- index::OptionalEdgeIndex
- index::OptionalNodeIndex
- interface::Edge
- interface::Neighbor
- interface::subgraph::EdgeFilteredEdgeIterator
- interface::subgraph::EdgeFilteredNeighborIterator
Enums
Traits
- algo::dijkstra::NodeWeightArray
- algo::dijkstra::Weight
- algo::dijkstra::WeightedEdgeData
- algo::queue::BidirectedQueue
- algo::traversal::ForbiddenSubgraph
- algo::traversal::TraversalNeighborStrategy
- algo::traversal::TraversalQueueStrategy
- index::GraphIndex
- index::OptionalGraphIndex
- interface::DynamicGraph
- interface::GraphBase
- interface::ImmutableGraphContainer
- interface::MutableGraphContainer
- interface::NavigableGraph
- interface::StaticGraph
- interface::WalkableGraph
- interface::subgraph::DecoratingSubgraph
- walks::EdgeWalk
- walks::NodeWalk
Functions
- algo::components::decompose_strongly_connected_components
- algo::components::decompose_weakly_connected_components
- algo::components::extract_subgraphs_from_node_mapping
- algo::components::is_cycle
- algo::components::is_strong_bridge
- algo::components::is_strongly_connected
- algo::eulerian::decomposes_into_eulerian_cycles
- algo::eulerian::find_non_eulerian_nodes
- algo::eulerian::find_non_eulerian_nodes_with_differences
- algo::predefined_graphs::compute_m_from_n_and_c
- algo::predefined_graphs::create_binary_tree
- algo::predefined_graphs::create_random_graph
- algo::predefined_graphs::create_random_hamiltonian_graph
- algo::traversal::univocal_traversal::is_edge_self_bivalent
- implementation::petgraph_impl::new
- io::hamcircuit::read_hamcircuit_from_tsplib_atsp
- io::hamcircuit::read_hamcircuit_from_tsplib_tsp
- io::hamcircuit::write_hamcircuit_as_tsplib_atsp
- io::hamcircuit::write_hamcircuit_as_tsplib_tsp
- io::write_topology
Typedefs
- algo::dijkstra::DefaultDijkstra
- algo::traversal::PostOrderBackwardDfs
- algo::traversal::PostOrderForwardDfs
- algo::traversal::PostOrderUndirectedDfs
- algo::traversal::PreOrderBackwardBfs
- algo::traversal::PreOrderBackwardDfs
- algo::traversal::PreOrderForwardBfs
- algo::traversal::PreOrderForwardDfs
- algo::traversal::PreOrderUndirectedBfs
- algo::traversal::PreOrderUndirectedDfs
- walks::VecEdgeWalk
- walks::VecNodeWalk