List of all items

Structs

• acyclic::Acyclic
• acyclic::TopologicalPosition
• acyclic::order_map::OrderMap
• acyclic::order_map::TopologicalPosition
• adj::EdgeIndex
• adj::EdgeIndices
• adj::EdgeReference
• adj::EdgeReferences
• adj::List
• adj::Neighbors
• adj::NodeIndices
• adj::OutgoingEdgeIndices
• adj::OutgoingEdgeReferences
• adj::WSuc
• algo::Cycle
• algo::DfsSpace
• algo::NegativeCycle
• algo::articulation_points::ArticulationPointTracker
• algo::astar::PathTracker
• algo::bellman_ford::Paths
• algo::dijkstra::AlgoResult
• algo::dominators::DominatedByIter
• algo::dominators::Dominators
• algo::dominators::DominatorsIter
• algo::feedback_arc_set::Buckets
• algo::feedback_arc_set::FasNode
• algo::feedback_arc_set::FasNodeContainer
• algo::feedback_arc_set::FasNodeIndex
• algo::feedback_arc_set::linked_list::LinkedList
• algo::feedback_arc_set::linked_list::LinkedListEntry
• algo::feedback_arc_set::linked_list::LinkedListPosition
• algo::isomorphism::matching::GraphMatcher
• algo::isomorphism::semantic::NoSemanticMatch
• algo::isomorphism::state::Vf2State
• algo::matching::MatchedEdges
• algo::matching::MatchedNodes
• algo::matching::Matching
• algo::min_spanning_tree::MinSpanningTree
• algo::min_spanning_tree::MinSpanningTreePrim
• algo::scc::tarjan_scc::NodeData
• algo::scc::tarjan_scc::TarjanScc
• csr::Csr
• csr::EdgeReference
• csr::EdgeReferences
• csr::Edges
• csr::EdgesNotSorted
• csr::Neighbors
• csr::NodeIdentifiers
• csr::NodeReferences
• data::FilterElements
• dot::Configs
• dot::Dot
• dot::Escaped
• dot::Escaper
• dot::FnFmt
• graph::Edge
• graph::EdgeIndex
• graph::EdgeIndices
• graph::EdgeReference
• graph::EdgeReferences
• graph::EdgeWeightsMut
• graph::Edges
• graph::EdgesConnecting
• graph::Externals
• graph::Frozen
• graph::Graph
• graph::Neighbors
• graph::Node
• graph::NodeIndex
• graph::NodeIndices
• graph::NodeReferences
• graph::NodeWeightsMut
• graph::WalkNeighbors
• graph_impl::Edge
• graph_impl::EdgeIndex
• graph_impl::EdgeIndices
• graph_impl::EdgeReference
• graph_impl::EdgeReferences
• graph_impl::EdgeWeights
• graph_impl::EdgeWeightsMut
• graph_impl::Edges
• graph_impl::EdgesConnecting
• graph_impl::EdgesWalkerMut
• graph_impl::Externals
• graph_impl::Frozen
• graph_impl::Graph
• graph_impl::Neighbors
• graph_impl::Node
• graph_impl::NodeIndex
• graph_impl::NodeIndices
• graph_impl::NodeReferences
• graph_impl::NodeWeights
• graph_impl::NodeWeightsMut
• graph_impl::WalkNeighbors
• graph_impl::stable_graph::EdgeIndices
• graph_impl::stable_graph::EdgeReference
• graph_impl::stable_graph::EdgeReferences
• graph_impl::stable_graph::Edges
• graph_impl::stable_graph::EdgesConnecting
• graph_impl::stable_graph::Externals
• graph_impl::stable_graph::Neighbors
• graph_impl::stable_graph::NodeIndices
• graph_impl::stable_graph::NodeReferences
• graph_impl::stable_graph::StableGraph
• graph_impl::stable_graph::StableGraphEdge
• graph_impl::stable_graph::StableGraphNode
• graph_impl::stable_graph::WalkNeighbors
• graphmap::AllEdges
• graphmap::AllEdgesMut
• graphmap::Edges
• graphmap::EdgesDirected
• graphmap::GraphMap
• graphmap::Neighbors
• graphmap::NeighborsDirected
• graphmap::NodeIdentifiers
• graphmap::NodeReferences
• graphmap::Nodes
• graphmap::Ptr
• iter_format::DebugMap
• iter_format::Format
• iter_format::NoPretty
• matrix_graph::EdgeReferences
• matrix_graph::Edges
• matrix_graph::IdIterator
• matrix_graph::IdStorage
• matrix_graph::MatrixGraph
• matrix_graph::Neighbors
• matrix_graph::NodeIdentifiers
• matrix_graph::NodeReferences
• matrix_graph::NotZero
• scored::MaxScored
• scored::MinScored
• stable_graph::EdgeIndices
• stable_graph::EdgeReference
• stable_graph::EdgeReferences
• stable_graph::Edges
• stable_graph::EdgesConnecting
• stable_graph::Externals
• stable_graph::Neighbors
• stable_graph::NodeIndices
• stable_graph::NodeReferences
• stable_graph::StableGraph
• stable_graph::StableGraphEdge
• stable_graph::StableGraphNode
• stable_graph::WalkNeighbors
• unionfind::UnionFind
• visit::Bfs
• visit::Dfs
• visit::DfsPostOrder
• visit::EdgeFiltered
• visit::EdgeFilteredEdges
• visit::EdgeFilteredNeighbors
• visit::EdgeFilteredNeighborsDirected
• visit::MaybeReversedEdgeReference
• visit::MaybeReversedEdgeReferences
• visit::MaybeReversedEdges
• visit::NodeFiltered
• visit::NodeFilteredEdgeReferences
• visit::NodeFilteredEdges
• visit::NodeFilteredNeighbors
• visit::NodeFilteredNodes
• visit::Reversed
• visit::ReversedEdgeReference
• visit::ReversedEdgeReferences
• visit::ReversedEdges
• visit::Time
• visit::Topo
• visit::UndirectedAdaptor
• visit::WalkerIter
• visit::dfsvisit::Time
• visit::filter::EdgeFiltered
• visit::filter::EdgeFilteredEdges
• visit::filter::EdgeFilteredNeighbors
• visit::filter::EdgeFilteredNeighborsDirected
• visit::filter::NodeFiltered
• visit::filter::NodeFilteredEdgeReferences
• visit::filter::NodeFilteredEdges
• visit::filter::NodeFilteredNeighbors
• visit::filter::NodeFilteredNodes
• visit::reversed::Reversed
• visit::reversed::ReversedEdgeReference
• visit::reversed::ReversedEdgeReferences
• visit::reversed::ReversedEdges
• visit::traversal::Bfs
• visit::traversal::Dfs
• visit::traversal::DfsPostOrder
• visit::traversal::Topo
• visit::traversal::WalkerIter
• visit::undirected_adaptor::MaybeReversedEdgeReference
• visit::undirected_adaptor::MaybeReversedEdgeReferences
• visit::undirected_adaptor::MaybeReversedEdges
• visit::undirected_adaptor::UndirectedAdaptor

Enums

• Directed
• Direction
• Undirected
• acyclic::AcyclicEdgeError
• algo::articulation_points::RecursionStep
• algo::isomorphism::matching::Frame
• algo::isomorphism::matching::OpenList
• algo::matching::Label
• csr::CsrError
• data::Element
• dot::Config
• dot::RankDir
• graph::GraphError
• graph_impl::GraphError
• graph_impl::Pair
• graphmap::CompactDirection
• matrix_graph::MatrixError
• matrix_graph::NeighborIterDirection
• visit::Control
• visit::DfsEvent
• visit::dfsvisit::Control
• visit::dfsvisit::DfsEvent

Traits

• EdgeType
• IntoWeightedEdge
• algo::BoundedMeasure
• algo::FloatMeasure
• algo::Measure
• algo::PositiveMeasure
• algo::UnitMeasure
• algo::isomorphism::semantic::EdgeMatcher
• algo::isomorphism::semantic::NodeMatcher
• algo::matching::WithDummy
• data::Build
• data::Create
• data::DataMap
• data::DataMapMut
• data::ElementIterator
• data::FromElements
• graph6::FromGraph6
• graph6::ToGraph6
• graph6::graph6_decoder::FromGraph6
• graph6::graph6_encoder::ToGraph6
• graph::GraphIndex
• graph::IndexType
• graph_impl::GraphIndex
• graph_impl::IndexType
• graphmap::NodeTrait
• iter_format::IterFormatExt
• iter_utils::IterUtilsExt
• matrix_graph::Nullable
• matrix_graph::Zero
• matrix_graph::private::Sealed
• visit::ControlFlow
• visit::Data
• visit::EdgeCount
• visit::EdgeIndexable
• visit::EdgeRef
• visit::FilterEdge
• visit::FilterNode
• visit::GetAdjacencyMatrix
• visit::GraphBase
• visit::GraphProp
• visit::GraphRef
• visit::IntoEdgeReferences
• visit::IntoEdges
• visit::IntoEdgesDirected
• visit::IntoNeighbors
• visit::IntoNeighborsDirected
• visit::IntoNodeIdentifiers
• visit::IntoNodeReferences
• visit::NodeCompactIndexable
• visit::NodeCount
• visit::NodeIndexable
• visit::NodeRef
• visit::VisitMap
• visit::Visitable
• visit::Walker
• visit::dfsvisit::ControlFlow
• visit::filter::FilterEdge
• visit::filter::FilterNode
• visit::traversal::Walker

Macros

• acyclic::impl_graph_traits
• algo::impl_bounded_measure_float
• algo::impl_bounded_measure_integer
• algo::impl_positive_measure
• algo::impl_unit_measure
• data::DataMap
• data::DataMapMut
• data::access0
• dot::make_config_struct
• graph_impl::frozen::access0
• iter_format::impl_format
• macros::clone_fields
• macros::iterator_wrap
• matrix_graph::not_zero_impl
• matrix_graph::not_zero_impls
• visit::Data
• visit::EdgeCount
• visit::EdgeIndexable
• visit::GetAdjacencyMatrix
• visit::GraphBase
• visit::GraphProp
• visit::IntoEdgeReferences
• visit::IntoEdges
• visit::IntoEdgesDirected
• visit::IntoNeighbors
• visit::IntoNeighborsDirected
• visit::IntoNodeIdentifiers
• visit::IntoNodeReferences
• visit::NodeCompactIndexable
• visit::NodeCount
• visit::NodeIndexable
• visit::Visitable
• visit::dfsvisit::try_control
• visit::filter::access0
• visit::macros::delegate_impl
• visit::macros::deref
• visit::macros::deref_twice
• visit::macros::remove_sections
• visit::macros::remove_sections_inner
• visit::macros::trait_template
• visit::reversed::access0
• visit::undirected_adaptor::access0

Functions

• acyclic::dfs
• adj::proj1
• adj::proj2
• algo::articulation_points::_dfs
• algo::articulation_points::articulation_points
• algo::astar::astar
• algo::bellman_ford::bellman_ford
• algo::bellman_ford::bellman_ford_initialize_relax
• algo::bellman_ford::find_negative_cycle
• algo::bridges::bridges
• algo::coloring::dsatur_coloring
• algo::condensation
• algo::connected_components
• algo::dijkstra::bidirectional_dijkstra
• algo::dijkstra::dijkstra
• algo::dijkstra::with_dynamic_goal
• algo::dominators::intersect
• algo::dominators::predecessor_sets_to_idx_vecs
• algo::dominators::simple_fast
• algo::dominators::simple_fast_post_order
• algo::feedback_arc_set::good_node_sequence
• algo::feedback_arc_set::greedy_feedback_arc_set
• algo::floyd_warshall::_floyd_warshall_path
• algo::floyd_warshall::floyd_warshall
• algo::floyd_warshall::floyd_warshall_path
• algo::floyd_warshall::is_greater
• algo::floyd_warshall::set_object
• algo::has_path_connecting
• algo::is_bipartite_undirected
• algo::is_cyclic_directed
• algo::is_cyclic_undirected
• algo::isomorphism::is_isomorphic
• algo::isomorphism::is_isomorphic_matching
• algo::isomorphism::is_isomorphic_subgraph
• algo::isomorphism::is_isomorphic_subgraph_matching
• algo::isomorphism::matching::is_feasible
• algo::isomorphism::matching::isomorphisms
• algo::isomorphism::matching::next_candidate
• algo::isomorphism::matching::next_from_ix
• algo::isomorphism::matching::pop_state
• algo::isomorphism::matching::push_state
• algo::isomorphism::subgraph_isomorphisms_iter
• algo::johnson::johnson
• algo::johnson::johnson_reweight
• algo::k_shortest_path::k_shortest_path
• algo::matching::augment_path
• algo::matching::find_join
• algo::matching::greedy_matching
• algo::matching::greedy_matching_inner
• algo::matching::maximum_matching
• algo::matching::non_backtracking_dfs
• algo::maximal_cliques::bron_kerbosch_pivot
• algo::maximal_cliques::maximal_cliques
• algo::maximum_flow::dinics
• algo::maximum_flow::dinics::adjusted_residual_flow
• algo::maximum_flow::dinics::build_level_graph
• algo::maximum_flow::dinics::dinics
• algo::maximum_flow::dinics::find_augmenting_path
• algo::maximum_flow::dinics::find_blocking_flow
• algo::maximum_flow::dinics::min
• algo::maximum_flow::dinics::other_endpoint
• algo::maximum_flow::dinics::residual_capacity
• algo::maximum_flow::ford_fulkerson
• algo::maximum_flow::ford_fulkerson::adjust_residual_flow
• algo::maximum_flow::ford_fulkerson::ford_fulkerson
• algo::maximum_flow::ford_fulkerson::has_augmented_path
• algo::maximum_flow::ford_fulkerson::other_endpoint
• algo::maximum_flow::ford_fulkerson::residual_capacity
• algo::min_spanning_tree::min_spanning_tree
• algo::min_spanning_tree::min_spanning_tree_prim
• algo::page_rank::out_edges_info
• algo::page_rank::page_rank
• algo::scc::kosaraju_scc::kosaraju_scc
• algo::scc::kosaraju_scc::scc
• algo::scc::tarjan_scc::tarjan_scc
• algo::simple_paths::all_simple_paths
• algo::simple_paths::all_simple_paths_multi
• algo::spfa::spfa
• algo::spfa::spfa_loop
• algo::steiner_tree::compute_metric_closure
• algo::steiner_tree::compute_shortest_path_length
• algo::steiner_tree::non_terminal_leaves
• algo::steiner_tree::steiner_tree
• algo::steiner_tree::subgraph_edges_from_metric_closure
• algo::toposort
• algo::tred::dag_to_toposorted_adjacency_list
• algo::tred::dag_transitive_reduction_closure
• algo::with_dfs
• data::from_elements_indexable
• graph6::from_graph6_representation
• graph6::get_graph6_representation
• graph6::graph6_decoder::bytes_vector_to_bits_vector
• graph6::graph6_decoder::from_graph6_representation
• graph6::graph6_decoder::get_bits_as_decimal
• graph6::graph6_decoder::get_edges
• graph6::graph6_decoder::get_number_as_bits
• graph6::graph6_decoder::get_order_bytes_and_adj_matrix_bytes
• graph6::graph6_encoder::bits_to_ascii
• graph6::graph6_encoder::get_adj_matrix_upper_diagonal_as_bits
• graph6::graph6_encoder::get_graph6_representation
• graph6::graph6_encoder::get_graph_order_as_bits
• graph6::graph6_encoder::get_number_as_bits
• graph::edge_index
• graph::node_index
• graph_impl::edge_index
• graph_impl::edges_walker_mut
• graph_impl::index_twice
• graph_impl::node_index
• graph_impl::stable_graph::swap_pair
• graph_impl::swap_pair
• graphmap::ptr_eq
• matrix_graph::ensure_len
• matrix_graph::extend_flat_square_matrix
• matrix_graph::extend_linearized_matrix
• matrix_graph::extend_lower_triangular_matrix
• matrix_graph::node_index
• matrix_graph::to_flat_square_matrix_position
• matrix_graph::to_linearized_matrix_position
• matrix_graph::to_lower_triangular_matrix_position
• operator::complement
• unionfind::get_unchecked
• unionfind::get_unchecked_mut
• visit::depth_first_search
• visit::dfsvisit::depth_first_search
• visit::dfsvisit::dfs_visitor
• visit::dfsvisit::time_post_inc

Type Aliases

• adj::NodeIndex
• adj::Row
• adj::RowIter
• adj::SomeIter
• adj::UnweightedList
• algo::DfsSpaceType
• algo::dominators::PredecessorSets
• algo::feedback_arc_set::NodeLinkedList
• algo::steiner_tree::Edge
• algo::steiner_tree::Subgraph
• csr::EdgeIndex
• csr::NodeIndex
• graph::DefaultIx
• graph::DiGraph
• graph::UnGraph
• graph_impl::DefaultIx
• graph_impl::DiGraph
• graph_impl::UnGraph
• graph_impl::stable_graph::StableDiGraph
• graph_impl::stable_graph::StableUnGraph
• graphmap::DiGraphMap
• graphmap::UnGraphMap
• matrix_graph::DefaultIx
• matrix_graph::DiMatrix
• matrix_graph::NodeIndex
• matrix_graph::UnMatrix
• stable_graph::StableDiGraph
• stable_graph::StableUnGraph

Statics

• dot::EDGE
• dot::INDENT
• dot::TYPE

Constants

• algo::dominators::UNDEFINED
• csr::BINARY_SEARCH_CUTOFF
• graph6::graph6_decoder::N
• graph6::graph6_encoder::N
• graph_impl::DIRECTIONS