{"id":60980,"library":"suitesparse-colamd","title":"SuiteSparse COLAMD","description":"Routines for column approximate minimum degree ordering algorithm in SuiteSparse.","status":"active","version":"3.3.4","language":"cpp","source_language":null,"source_url":null,"tags":["sparse","matrix","ordering","linear-algebra","suite-sparse"],"install":[{"cmd":"vcpkg install suitesparse-colamd","lang":"bash","label":"vcpkg"},{"cmd":"# CMakeLists.txt\nfind_package(suitesparse_colamd CONFIG REQUIRED)\ntarget_link_libraries(main PRIVATE SuiteSparse::COLAMD)","lang":"cmake","label":"CMake"}],"dependencies":[],"imports":[{"symbol":"colamd.h","correct":"#include <colamd.h>"}],"quickstart":{"code":"#include \"colamd.h\"\n#include <vector>\n\nint main() {\n    int n_row = 5, n_col = 5;\n    std::vector<int> col_begin = {0, 2, 4, 6, 8, 10};\n    std::vector<int> row_idx = {0,1, 0,2, 1,3, 2,4, 3,4};\n    std::vector<int> perm(n_col);\n    int result = colamd(n_row, n_col, col_begin.data(), row_idx.data(), perm.data(), nullptr, 0);\n    return result;\n}","lang":"cpp","description":"Compute column approximate minimum degree ordering of a sparse matrix."},"warnings":[],"env_vars":null,"search_vec":"'algebra':18 'algorithm':10 'approxim':6 'colamd':2 'column':5 'degre':8 'linear':17 'linear-algebra':16 'matrix':14 'minimum':7 'order':9,15 'routin':3 'spars':13,21 'suit':20 'suite-spars':19 'suitespars':1,12","created_at":"2026-06-17T04:34:42.101162+00:00","updated_at":"2026-06-17T04:34:42.101162+00:00","problems":[],"ecosystem":"vcpkg","meta_description":null,"install_score":null,"quickstart_score":null,"quickstart_tag":null,"pypi_latest":null,"cli_name":null,"cli_version":null,"type":"library","homepage":null,"github":null,"docs":null,"changelog":null,"pypi":null,"npm":null,"openapi_spec":null,"status_page":null,"smithery":null,"categories":["utility"],"base_url":null,"auth_type":null,"provenance":{"verified_status":null,"verified_at":null,"last_verified":"2026-06-17","next_check":"2026-12-14","install_tag":null}}