Skip to content

Latest commit

 

History

History
 
 

graph

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
test
test
 
 
README.md
README.md
 
 
bipartite_matching(slow).hpp
bipartite_matching(slow).hpp
 
 
bipartite_matching.hpp
bipartite_matching.hpp
 
 
bipartite_matching.md
bipartite_matching.md
 
 
chromatic_number.hpp
chromatic_number.hpp
 
 
chromatic_number.md
chromatic_number.md
 
 
directed_mst.hpp
directed_mst.hpp
 
 
dulmage_mendelsohn_decomposition.hpp
dulmage_mendelsohn_decomposition.hpp
 
 
dulmage_mendelsohn_decomposition.md
dulmage_mendelsohn_decomposition.md
 
 
enumerate_cliques.hpp
enumerate_cliques.hpp
 
 
enumerate_cliques.md
enumerate_cliques.md
 
 
eulerian_trail.hpp
eulerian_trail.hpp
 
 
general_matching.hpp
general_matching.hpp
 
 
grid_graph_template.hpp
grid_graph_template.hpp
 
 
incremental_bridge_connectivity.hpp
incremental_bridge_connectivity.hpp
 
 
incremental_scc.hpp
incremental_scc.hpp
 
 
incremental_scc.md
incremental_scc.md
 
 
lowlink.hpp
lowlink.hpp
 
 
lowlink.md
lowlink.md
 
 
manhattan_mst.hpp
manhattan_mst.hpp
 
 
manhattan_mst.md
manhattan_mst.md
 
 
max_weight_independent_set.hpp
max_weight_independent_set.hpp
 
 
max_weight_independent_set.md
max_weight_independent_set.md
 
 
maximum_independent_set.hpp
maximum_independent_set.hpp
 
 
maximum_independent_set.md
maximum_independent_set.md
 
 
nonzero_path_of_group_labeled_graph.hpp
nonzero_path_of_group_labeled_graph.hpp
 
 
nonzero_path_of_group_labeled_graph.md
nonzero_path_of_group_labeled_graph.md
 
 
paths_of_length_two_decomposition.hpp
paths_of_length_two_decomposition.hpp
 
 
paths_of_length_two_decomposition.md
paths_of_length_two_decomposition.md
 
 
segment_edge_shortest_path.hpp
segment_edge_shortest_path.hpp
 
 
shortest_cycle.hpp
shortest_cycle.hpp
 
 
shortest_cycle01.hpp
shortest_cycle01.hpp
 
 
shortest_path.hpp
shortest_path.hpp
 
 
shortest_path.md
shortest_path.md
 
 
strongly_connected_components.hpp
strongly_connected_components.hpp
 
 
strongly_connected_components_bitset.hpp
strongly_connected_components_bitset.hpp
 
 

README.md

General Graph Algorithms

Algorithms for trees are not here.

Lowlinkについて

  • Articulation points （関節点）
    • その一点を消去するとグラフが連結でなくなるような頂点
  • Bridge （橋）
    • その一辺を消去するとグラフが連結でなくなるような辺