Graph/tree_diameter library
Functions
-
treeDiameter<
T> (Map< T, List< tree) → Map<T> >String, dynamic> - Computes the diameter of a tree (longest path between any two nodes).
- lunaris_engine package
- documentation
- Graph/tree_diameter.dart
lunaris_engine package
- Libraries
- Backtracking/combination_sum
- Backtracking/combinations
- Backtracking/letter_combinations_phone_number
- Backtracking/n_queens
- Backtracking/permutations
- Backtracking/rat_in_a_maze
- Backtracking/subset_generation
- Backtracking/sudoku_solver
- Backtracking/word_search
- Compression/arithmetic
- Compression/bwt
- Compression/huffman
- Compression/lzw
- Compression/rle
- Consensus/bft
- Consensus/delegated_proof_of_stake
- Consensus/fba
- Consensus/gossip_protocol
- Consensus/pbft
- Consensus/proof_of_authority
- Consensus/proof_of_burn
- Consensus/proof_of_capacity
- Consensus/proof_of_elapsed_time
- Consensus/proof_of_stake
- Consensus/proof_of_work
- Cryptographic/argon2
- Cryptographic/bls_signatures
- Cryptographic/ecdsa
- Cryptographic/eddsa
- Cryptographic/keccak256
- Cryptographic/ripemd160
- Cryptographic/scrypt
- Cryptographic/scrypt_mining
- Cryptographic/sha256
- dp_algorithms/alternating_subsequences
- dp_algorithms/burst_balloons
- dp_algorithms/cherry_pickup
- dp_algorithms/coin_change
- dp_algorithms/coin_change_bottom_up
- dp_algorithms/count_palindromic_subsequences
- dp_algorithms/decode_ways
- dp_algorithms/edit_distance
- dp_algorithms/fibonacci_memoization
- dp_algorithms/house_robber
- dp_algorithms/interleaving_string
- dp_algorithms/jump_game
- dp_algorithms/knapsack_01
- dp_algorithms/longest_bitonic_subsequence
- dp_algorithms/longest_common_subsequence
- dp_algorithms/longest_increasing_subsequence
- dp_algorithms/matrix_chain_multiplication
- dp_algorithms/matrix_path_sum
- dp_algorithms/max_sum_increasing_subsequence
- dp_algorithms/min_cuts_palindrome_partitioning
- dp_algorithms/minimum_path_sum
- dp_algorithms/paint_house
- dp_algorithms/partition_equal_subset_sum
- dp_algorithms/regex_matching
- dp_algorithms/rod_cutting
- dp_algorithms/subset_sum
- dp_algorithms/unique_paths_with_obstacles
- dp_algorithms/wildcard_matching
- Graph/articulation_points
- Graph/bellman_ford
- Graph/bfs
- Graph/bipartite_graph
- Graph/bridge_finding
- Graph/chinese_postman
- Graph/connected_components
- Graph/cycle_detection
- Graph/dfs
- Graph/dijkstra
- Graph/dinics_algorithm
- Graph/edmonds_karp
- Graph/eulerian_path
- Graph/floyd_warshall
- Graph/graph_coloring
- Graph/hamiltonian_path
- Graph/hierholzer
- Graph/johnsons_algorithm
- Graph/kosaraju_scc
- Graph/mst_kruskal
- Graph/mst_prim
- Graph/shortest_path
- Graph/spfa
- Graph/stoer_wagner_min_cut
- Graph/tarjans_scc
- Graph/topological_sort
- Graph/transitive_closure
- Graph/tree_diameter
- Graph/union_find
- Graph/weighted_edge
- Graph/yens_algorithm
- LinkedList/add_two_numbers_linked_list
- LinkedList/convert_binary_linked_list_to_int
- LinkedList/detect_and_remove_loop
- LinkedList/detect_cycle
- LinkedList/doubly_linked_list_node
- LinkedList/insert_delete_at_position
- LinkedList/intersection_detection_hashset
- LinkedList/intersection_of_lists
- LinkedList/linked_list_node
- LinkedList/merge_sort_linked_list
- LinkedList/merge_sorted_lists
- LinkedList/palindrome_linked_list
- LinkedList/partition_list
- LinkedList/remove_duplicates_sorted_list
- LinkedList/remove_nth_from_end
- LinkedList/reverse_linked_list
- LinkedList/reverse_nodes_in_k_group
- LinkedList/rotate_linked_list
- LinkedList/swap_nodes_in_pairs
- List/average_subarray
- List/binary_search
- List/bubble_sort
- List/counting_sort
- List/find_duplicates
- List/find_max_min
- List/insertion_sort
- List/kadanes_algorithm
- List/linear_search
- List/max_sum_subarray_of_size_k
- List/merge_sort
- List/min_sum
- List/prefix_sum
- List/quick_sort
- List/remove_duplicates
- List/reverse_list
- List/rotate_array_right
- List/selection_sort
- List/two_sum_sorted
- ListAdvancedSorts/bitonic_sort
- ListAdvancedSorts/bucket_sort
- ListAdvancedSorts/comb_sort
- ListAdvancedSorts/cycle_sort
- ListAdvancedSorts/gnome_sort
- ListAdvancedSorts/heap_sort
- ListAdvancedSorts/lis_binary_search
- ListAdvancedSorts/max_product_subarray
- ListAdvancedSorts/odd_even_sort
- ListAdvancedSorts/pancake_sort
- ListAdvancedSorts/pigeonhole_sort
- ListAdvancedSorts/quickselect
- ListAdvancedSorts/radix_sort
- ListAdvancedSorts/shell_sort
- ListAdvancedSorts/stooge_sort
- lunaris_engine
- MachineLearning/actor_critic
- MachineLearning/ann
- MachineLearning/autoencoder
- MachineLearning/bayesian_optimization
- MachineLearning/catboost_like
- MachineLearning/cnn
- MachineLearning/dbscan
- MachineLearning/decision_tree
- MachineLearning/dqn
- MachineLearning/gan
- MachineLearning/genetic_algorithm
- MachineLearning/gmm
- MachineLearning/gradient_boosting
- MachineLearning/gradient_boosting_classifier
- MachineLearning/gru
- MachineLearning/hierarchical_clustering
- MachineLearning/kmeans
- MachineLearning/knn
- MachineLearning/lightgbm_like
- MachineLearning/linear_regression
- MachineLearning/logistic_regression
- MachineLearning/lstm
- MachineLearning/mcts
- MachineLearning/mdp
- MachineLearning/naive_bayes
- MachineLearning/particle_swarm
- MachineLearning/pca
- MachineLearning/policy_gradient
- MachineLearning/ppo
- MachineLearning/q_learning
- MachineLearning/random_forest
- MachineLearning/rnn
- MachineLearning/sarsa
- MachineLearning/simulated_annealing
- MachineLearning/svm
- MachineLearning/transformer
- MachineLearning/tsne
- MachineLearning/xgboost_like
- map/all_pairs_with_sum
- map/anagram_checker
- map/count_pairs_with_diff
- map/find_subarrays_with_sum
- map/first_non_repeated_element
- map/frequency_count
- map/group_anagrams
- map/group_by_key
- map/index_mapping
- map/invert_map
- map/length_of_longest_substring
- map/lru_cache
- map/merge_maps_conflict
- map/min_window_substring
- map/most_frequent_element
- map/mru_cache
- map/top_k_frequent
- map/two_sum
- map/word_frequency_ranking
- matrix/flood_fill
- matrix/island_count_bfs
- matrix/island_count_dfs
- matrix/matrix_rotation
- matrix/path_sum
- matrix/shortest_path_in_grid
- matrix/spiral_traversal
- matrix/surrounded_regions
- matrix/word_search
- network/a_star
- network/dinics_algorithm
- network/edmonds_karp
- network/ford_fulkerson
- network/network_algorithms
- network/tarjans_algorithm
- network/union_find
- networkAdv/banner
- networkAdv/cidr
- networkAdv/http_probe
- networkAdv/ip_utils
- networkAdv/network_helpers
- networkAdv/prioritize
- networkAdv/reporting
- networkAdv/socket_probe
- networkAdv/timeout
- networkAdv/tls
- networkop/edmonds_blossom
- networkop/hungarian
- networkop/max_flow_min_cut
- networkop/min_cost_flow
- numerical/bisection
- numerical/differentiation
- numerical/integration
- numerical/lu_decomposition
- numerical/newton_raphson
- numerical/qr_decomposition
- RoutingNET/bgp_algorithm
- RoutingNET/distance_vector_routing
- RoutingNET/link_state_routing
- RoutingNET/ospf_algorithm
- RoutingNET/rip_algorithm
- Set/bloom_filter
- Set/disjoint_check
- Set/disjoint_set
- Set/find_intersection
- Set/has_duplicates
- Set/has_two_sum
- Set/has_unique_window
- Set/is_frequency_unique
- Set/list_to_set_preserve_order
- Set/multiset_operations
- Set/power_set
- Set/set_difference
- Set/subset_check
- Set/superset_check
- Set/symmetric_difference
- String/anagram_checker
- String/atoi
- String/boyer_moore_search
- String/brute_force_search
- String/count_vowels_consonants
- String/edit_distance
- String/integer_roman
- String/kmp_search
- String/longest_common_prefix
- String/longest_palindromic_substring
- String/longest_repeating_substring
- String/manacher_longest_palindrome
- String/min_window_subsequence
- String/palindrome_checker
- String/rabin_karp_search
- String/remove_consecutive_duplicates
- String/reverse_string
- String/rolling_hash
- String/string_compression
- String/string_permutations
- String/z_algorithm
- Tree/balanced_tree_check
- Tree/binary_tree_node
- Tree/bottom_top_view_binary_tree
- Tree/boundary_traversal
- Tree/construct_tree_inorder_postorder
- Tree/construct_tree_inorder_preorder
- Tree/convert_sorted_array_to_bst
- Tree/count_full_nodes
- Tree/count_half_nodes
- Tree/count_leaf_nodes
- Tree/flatten_binary_tree_to_linked_list
- Tree/invert_tree
- Tree/level_order_traversal
- Tree/lowest_common_ancestor
- Tree/lowest_common_ancestor_no_bst
- Tree/merkle_tree
- Tree/morris_traversal
- Tree/path_sum_in_tree
- Tree/print_all_root_to_leaf_paths
- Tree/threaded_binary_tree_traversal
- Tree/tree_depth
- Tree/tree_diameter
- Tree/tree_serialization
- Tree/tree_traversals
- Tree/validate_bst
- Tree/vertical_order_traversal
- Tree/zigzag_traversal
- wireless_p2p/aodv
- wireless_p2p/chord
- wireless_p2p/dsr
- wireless_p2p/kademlia