[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7CP3W0AMXQ5HRBAZP2F88NY":3,"skill-same:01M7CP3W0AMXQ5HRBAZP2F88NY":61},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":33,"commitSha":34,"skillDirectory":35,"forksCount":36,"repositoryHtmlUrl":37,"repositoryHomepageUrl":6,"ownerHtmlUrl":38,"ownerBlogUrl":6,"ownerDescription":39,"updatedAt":40,"install":41,"resources":54},"01M7CP3W0AMXQ5HRBAZP2F88NY","cuopt-routing-api-python",null,"Vehicle routing (VRP, TSP, PDP) with cuOpt — Python API only. Use when the user is building or solving routing in Python.","om-scogo\u002Fskillsh-scraper","om-scogo","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F160466840?v=4","01M79AWB6DFVCQ7RK70CS34B96","Om Achrekar","01M79AWB6ZM9SKR8KDH1WSSM22",0,"Apache-2.0","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fnvidia-skills\u002Fcuopt-routing-api-python\u002FSkill.md",[],[],"2026-11-15 14:19:17",false,"---\nname: cuopt-routing-api-python\nversion: \"26.08.00\"\ndescription: Vehicle routing (VRP, TSP, PDP) with cuOpt — Python API only. Use when the user is building or solving routing in Python.\nlicense: Apache-2.0\nmetadata:\n  author: NVIDIA cuOpt Team\n  tags:\n    - cuopt\n    - routing\n    - vrp\n    - tsp\n    - python\n---\n\n\n\n# cuOpt Routing — Python API\n\nThis skill is **Python only**. Routing has no C API in cuOpt.\n\n## Required questions\n\nAsk these if not already clear:\n\n1. **Problem type** — TSP, VRP, or PDP?\n2. **Locations** — How many? Depot(s)? Cost or distance between pairs (matrix or derived)?\n3. **Orders \u002F tasks** — Which locations must be visited? Demand or service per stop?\n4. **Fleet** — Number of vehicles, capacity per vehicle (and per dimension if multiple), start\u002Fend locations?\n5. **Constraints** — Time windows (earliest\u002Flatest arrival), service times, precedence (order A before B)?\n\n## Minimal VRP Example\n\n```python\nimport cudf\nfrom cuopt import routing\n\ncost_matrix = cudf.DataFrame([...], dtype=\"float32\")\ndm = routing.DataModel(n_locations=4, n_fleet=2, n_orders=3)\ndm.add_cost_matrix(cost_matrix)\ndm.set_order_locations(cudf.Series([1, 2, 3], dtype=\"int32\"))\nsolution = routing.Solve(dm, routing.SolverSettings())\n\nif solution.get_status() == 0:\n    solution.display_routes()\n```\n\n## Adding Constraints\n\n```python\n# Time windows\ndm.add_transit_time_matrix(transit_time_matrix)\ndm.set_order_time_windows(earliest_series, latest_series)\n\n# Capacities\ndm.add_capacity_dimension(\"weight\", demand_series, capacity_series)\ndm.set_order_service_times(service_times)\ndm.set_vehicle_locations(start_locations, end_locations)\ndm.set_vehicle_time_windows(earliest_start, latest_return)\n\n# Pickup-delivery pairs\ndm.set_pickup_delivery_pairs(pickup_indices, delivery_indices)\n\n# Precedence\ndm.add_order_precedence(node_id=2, preceding_nodes=np.array([0, 1]))\n```\n\n## Solution Checking\n\n```python\nstatus = solution.get_status()  # 0=SUCCESS, 1=FAIL, 2=TIMEOUT, 3=EMPTY\nif status == 0:\n    route_df = solution.get_route()\n    total_cost = solution.get_total_objective()\nelse:\n    print(solution.get_error_message())\n    print(solution.get_infeasible_orders().to_list())\n```\n\n## Data Types (use explicit dtypes)\n\n```python\ncost_matrix = cost_matrix.astype(\"float32\")\norder_locations = cudf.Series([...], dtype=\"int32\")\ndemand = cudf.Series([...], dtype=\"int32\")\n```\n\n## Solver Settings\n\n```python\nss = routing.SolverSettings()\nss.set_time_limit(30)\nss.set_verbose_mode(True)\nss.set_error_logging_mode(True)\n```\n\n## Common Issues\n\n| Problem | Fix |\n|---------|-----|\n| Empty solution | Widen time windows or check travel times |\n| Infeasible orders | Increase fleet or capacity |\n| Status != 0 with time windows | Add `add_transit_time_matrix()` |\n| Wrong cost | Check cost_matrix is symmetric |\n| `compute_waypoint_sequence` alters route_df | It replaces the `location` column with waypoint ids in place — pass `route_df.copy()` if you still need cost-matrix indices (e.g. when iterating per truck) |\n\n## Debugging\n\n**When status != 0:** `print(solution.get_error_message())` and `print(solution.get_infeasible_orders().to_list())` to see which orders are infeasible.\n\n**Data types:** Use explicit dtypes (float32, int32) for matrices and series to avoid silent errors.\n\n## Examples\n\n- [examples.md](references\u002Fexamples.md) — VRP, PDP, multi-depot\n- [server_examples.md](references\u002Fserver_examples.md) — REST client (curl, Python)\n- **Reference models:** This skill's `assets\u002F` — [vrp_basic](assets\u002Fvrp_basic\u002F), [pdp_basic](assets\u002Fpdp_basic\u002F). See [assets\u002FREADME.md](assets\u002FREADME.md).\n\n## Escalate\n\nFor contribution or build-from-source, see the developer skill.\n","# cuOpt Routing — Python API\n\nThis skill is **Python only**. Routing has no C API in cuOpt.\n\n## Required questions\n\nAsk these if not already clear:\n\n1. **Problem type** — TSP, VRP, or PDP?\n2. **Locations** — How many? Depot(s)? Cost or distance between pairs (matrix or derived)?\n3. **Orders \u002F tasks** — Which locations must be visited? Demand or service per stop?\n4. **Fleet** — Number of vehicles, capacity per vehicle (and per dimension if multiple), start\u002Fend locations?\n5. **Constraints** — Time windows (earliest\u002Flatest arrival), service times, precedence (order A before B)?\n\n## Minimal VRP Example\n\n```python\nimport cudf\nfrom cuopt import routing\n\ncost_matrix = cudf.DataFrame([...], dtype=\"float32\")\ndm = routing.DataModel(n_locations=4, n_fleet=2, n_orders=3)\ndm.add_cost_matrix(cost_matrix)\ndm.set_order_locations(cudf.Series([1, 2, 3], dtype=\"int32\"))\nsolution = routing.Solve(dm, routing.SolverSettings())\n\nif solution.get_status() == 0:\n    solution.display_routes()\n```\n\n## Adding Constraints\n\n```python\n# Time windows\ndm.add_transit_time_matrix(transit_time_matrix)\ndm.set_order_time_windows(earliest_series, latest_series)\n\n# Capacities\ndm.add_capacity_dimension(\"weight\", demand_series, capacity_series)\ndm.set_order_service_times(service_times)\ndm.set_vehicle_locations(start_locations, end_locations)\ndm.set_vehicle_time_windows(earliest_start, latest_return)\n\n# Pickup-delivery pairs\ndm.set_pickup_delivery_pairs(pickup_indices, delivery_indices)\n\n# Precedence\ndm.add_order_precedence(node_id=2, preceding_nodes=np.array([0, 1]))\n```\n\n## Solution Checking\n\n```python\nstatus = solution.get_status()  # 0=SUCCESS, 1=FAIL, 2=TIMEOUT, 3=EMPTY\nif status == 0:\n    route_df = solution.get_route()\n    total_cost = solution.get_total_objective()\nelse:\n    print(solution.get_error_message())\n    print(solution.get_infeasible_orders().to_list())\n```\n\n## Data Types (use explicit dtypes)\n\n```python\ncost_matrix = cost_matrix.astype(\"float32\")\norder_locations = cudf.Series([...], dtype=\"int32\")\ndemand = cudf.Series([...], dtype=\"int32\")\n```\n\n## Solver Settings\n\n```python\nss = routing.SolverSettings()\nss.set_time_limit(30)\nss.set_verbose_mode(True)\nss.set_error_logging_mode(True)\n```\n\n## Common Issues\n\n| Problem | Fix |\n|---------|-----|\n| Empty solution | Widen time windows or check travel times |\n| Infeasible orders | Increase fleet or capacity |\n| Status != 0 with time windows | Add `add_transit_time_matrix()` |\n| Wrong cost | Check cost_matrix is symmetric |\n| `compute_waypoint_sequence` alters route_df | It replaces the `location` column with waypoint ids in place — pass `route_df.copy()` if you still need cost-matrix indices (e.g. when iterating per truck) |\n\n## Debugging\n\n**When status != 0:** `print(solution.get_error_message())` and `print(solution.get_infeasible_orders().to_list())` to see which orders are infeasible.\n\n**Data types:** Use explicit dtypes (float32, int32) for matrices and series to avoid silent errors.\n\n## Examples\n\n- [examples.md](references\u002Fexamples.md) — VRP, PDP, multi-depot\n- [server_examples.md](references\u002Fserver_examples.md) — REST client (curl, Python)\n- **Reference models:** This skill's `assets\u002F` — [vrp_basic](assets\u002Fvrp_basic\u002F), [pdp_basic](assets\u002Fpdp_basic\u002F). See [assets\u002FREADME.md](assets\u002FREADME.md).\n\n## Escalate\n\nFor contribution or build-from-source, see the developer skill.\n",{"name":5,"license":15,"version":24,"metadata":25,"description":7},"26.08.00",{"tags":26,"author":32},[27,28,29,30,31],"cuopt","routing","vrp","tsp","python","NVIDIA cuOpt Team","main","8859218955d9504cd18b59e7892100718039d3b4","data\u002Fskills\u002Fnvidia-skills\u002Fcuopt-routing-api-python",1,"https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper","https:\u002F\u002Fgithub.com\u002Fom-scogo","SDE-1 @ Scogo ","2026-07-18 12:22:46",{"source":8,"skillName":5,"commands":42,"prompt":52,"zipAvailable":53},[43,46,49],{"tool":44,"command":45},"npx","npx skills add om-scogo\u002Fskillsh-scraper --skill cuopt-routing-api-python",{"tool":47,"command":48},"bunx","bunx skills add om-scogo\u002Fskillsh-scraper --skill cuopt-routing-api-python",{"tool":50,"command":51},"pnpm","pnpm dlx skills add om-scogo\u002Fskillsh-scraper --skill cuopt-routing-api-python","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fnvidia-skills\u002Fcuopt-routing-api-python\u002FSkill.md",true,[55],{"path":56,"resourceType":57,"resourceTypeDesc":58,"sizeBytes":59,"sourceHtmlUrl":60},"metadata.json","REFERENCE","参考文档",446,"https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fnvidia-skills\u002Fcuopt-routing-api-python\u002Fmetadata.json",[62,70,75,82,87,94],{"skillNo":63,"name":64,"nameZh":6,"description":65,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":66,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7D6MC9FAAEV4CMNYX8W7JTG","arxiv-search","Search arXiv physics, math, and computer science preprints using natural language queries. Powered by Valyu semantic search.","MIT","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fyorkeccak-scientific-skills\u002Farxiv-search\u002Fskills\u002Farxiv-search\u002FSKILL.md",[],[],{"skillNo":71,"name":64,"nameZh":6,"description":65,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":66,"licenseFileUrl":6,"sourceHtmlUrl":72,"categories":73,"keywords":74,"publishedAt":19},"01M7D6M85CKKN87TA98VCQV4H7","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fyorkeccak-scientific-skills\u002Farxiv-search\u002FSkill.md",[],[],{"skillNo":76,"name":77,"nameZh":6,"description":78,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":66,"licenseFileUrl":6,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":19},"01M7D4ZTCS4DR3CE4JY06X84T2","working-with-legacy-code","Safely change and test untested codebases using Feathers' \"Working Effectively with Legacy Code\". Use when the user mentions \"legacy code\", \"no tests\", \"untested codebase\", \"how do I test this\", \"seams\", \"characterization tests\", \"golden master\", \"sprout method\", \"afraid to change this code\", \"monster method\", \"dependency breaking\", or \"inherited a messy codebase\". Also trigger when changing code without tests safely, getting a class under test when constructors, statics, or singletons block it, adding features to tangled modules, or planning incremental test coverage for an old codebase. Covers the legacy-code change algorithm, seams, characterization tests, sprout\u002Fwrap, and dependency-breaking techniques. For refactoring code that already has tests, see refactoring-patterns. For day-to-day code quality, see clean-code.","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fwondelai-skills\u002Fworking-with-legacy-code\u002Fworking-with-legacy-code\u002FSKILL.md",[],[],{"skillNo":83,"name":77,"nameZh":6,"description":78,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":66,"licenseFileUrl":6,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":19},"01M7D4ZHZKJD2RSNGAF63V14P4","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fwondelai-skills\u002Fworking-with-legacy-code\u002FSkill.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":66,"licenseFileUrl":6,"sourceHtmlUrl":91,"categories":92,"keywords":93,"publishedAt":19},"01M7D4ZB4CJBFW5JE67CPH2QRV","web-typography","Select, pair, and implement typefaces for web projects. Use when the user mentions \"font pairing\", \"which typeface\", \"line height\", \"responsive typography\", \"web font loading\", \"type hierarchy\", \"variable fonts\", \"FOUT\u002FFOIT\", \"typographic scale\", or \"the text is hard to read\". Also trigger when choosing between system fonts and web fonts, optimizing font-loading performance, or designing readable long-form content. Covers readability evaluation, CSS implementation, and performance optimization. For overall UI design systems, see refactoring-ui. For dramatic typographic experiences, see top-design.","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fwondelai-skills\u002Fweb-typography\u002Fweb-typography\u002FSKILL.md",[],[],{"skillNo":95,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":66,"licenseFileUrl":6,"sourceHtmlUrl":96,"categories":97,"keywords":98,"publishedAt":19},"01M7D4Z4MVYVY3NMJ18BNV6WNA","https:\u002F\u002Fgithub.com\u002Fom-scogo\u002Fskillsh-scraper\u002Fblob\u002Fmain\u002Fdata\u002Fskills\u002Fwondelai-skills\u002Fweb-typography\u002FSkill.md",[],[]]