algo — C++23 日本語リファレンス
GitHub
リファレンス
algorithm
✅
binary_search
✅
coordinate_compression
✅
doubling
➖
integer_partition
➖
interval
✅
inversion_number
✅
largest_rectangle
✅
mex
✅
mo
✅
prefix_sum
✅
prefix_sum_2d
➖
rollback_mo
combinatorics
✅
bell
✅
combinatorics
✅
offline_binomial_sum
✅
partition_function
✅
stirling
✅
stirling_bell
✅
stirling_small_p_large_n
convolution
✅
fft
✅
formal_power_series
➖
garner
✅
ntt
✅
ntt_avx2
✅
subset_convolution
data_structure
✅
binary_trie
✅
disjoint_sparse_table
✅
dynamic_sequence
✅
dynamic_union_find
✅
dynamic_wavelet_matrix
✅
fenwick_tree
✅
flip_set
✅
linear_sparse_table
✅
merge_sort_tree
✅
offline_dynamic_connectivity
✅
ordered_set
✅
patricia_binary_trie
✅
potentialized_union_find
✅
range_min_max_sum
✅
range_set
✅
range_tree
✅
sparse_table
✅
swag
✅
tree64
➖
undo_deque
✅
undo_union_find
✅
union_find
✅
wavelet_matrix
✅
wavelet_matrix_rectangle_sum
dp
✅
convex_hull_trick
✅
li_chao_tree
✅
monotone_minima
✅
slope_trick
✅
subset_sum
✅
traced
➖
undo_slope_trick
flow
➖
bipartite_graph_matching
✅
bipartite_matching
✅
max_flow
✅
min_cost_flow
geometry
✅
convex_hull
✅
geometry
➖
geometry3d
✅
kdtree
graph
➖
bipartite_coloring
✅
chromatic_number
✅
cycle
✅
dominator_tree
✅
edge_input
✅
floyd_warshall
floyd_warshall
✅
functional_graph
✅
graph
✅
grid
✅
kruskal
✅
lowlink
✅
matrix_graph
✅
maximum_independent_set
✅
namori_graph
✅
prim
✅
scc
✅
shortest_path
➖
shortest_path_potential
➖
spanning_tree
✅
topological_sort
✅
two_sat
heap
➖
binary_heap
✅
dary_heap
✅
erasable_priority_queue
✅
fibonacci_heap
✅
interval_heap
✅
meldable_heap
✅
priority_k_sum
➖
radix_heap
linalg
✅
berlekamp_massey
✅
linear_recurrence
✅
matrix
✅
xor_basis
number_theory
✅
bigint
✅
chinese_rem
✅
discrete_log
✅
factorize
✅
floor_sum
✅
fraction
✅
min25_sieve
✅
min_linear
➖
misc
✅
modint
✅
multiplicative_function
✅
prime_counting
✅
prime_number
✅
root_mod
✅
stern_brocot_tree
parser
✅
ambiguous_expr
✅
cfg_graph
➖
hash_cons
✅
parser
persistent_ds
➖
partially_persistent_array
✅
partially_persistent_union_find
✅
persistent_array
➖
persistent_dual_segment_tree
✅
persistent_queue
✅
persistent_segment_tree
✅
persistent_stack
✅
persistent_union_find
random
✅
split_mix64
✅
xoroshiro128
➖
xorshift128
➖
xoshiro128
✅
zobrist_hash
segtree
✅
dual_segment_tree
✅
dynamic_lazy_segment_tree
✅
dynamic_segment_tree
➖
filtered_segment_tree
✅
lazy_segment_tree
✅
monoid
✅
segment_tree
✅
segment_tree_2d
string
✅
aho_corasick
➖
converter
✅
hashint
✅
kmp
✅
manacher
✅
misc
✅
palindromic_tree
✅
rolling_hash
➖
rolling_hash_2d
✅
suffix_array
✅
suffix_automaton
✅
suffix_tree
✅
trie
✅
z_algorithm
tree
✅
auxiliary_tree
✅
cartesian_tree
✅
centroid_decomposition
✅
dsu_on_tree
✅
dynamic_top_tree
✅
euler_tour
✅
euler_tour_tree
✅
hld
✅
linear_lca
✅
link_cut_tree
✅
rerooting
✅
segment_tree_on_tree
✅
static_top_tree
✅
tree_function
internal
✅
dynamic_bit_vector
✅
internal_bit_vector
✅
internal_csr
✅
internal_fft
✅
internal_fft_avx2
✅
internal_fps_avx2
✅
internal_math
✅
internal_random
✅
internal_type_traits
✅
wavelet_matrix_base
template
✅
atcoder
➖
library_checker
✅
sonic
✅
template
✅
vector
リファレンス
›
graph
›
graph/floyd_warshall.hpp
›
floyd_warshall
floyd_warshall
関数
·
ワーシャルフロイド法
template
<
class
T
>
void
floyd_warshall
(
matrix_graph
<
T
>
&
g
);
概要
ワーシャルフロイド法
計算量
頂点数を $V$ として $O(V^3)$