awesome-repositories.com
المدونة
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعحولكيفية ترتيب النتائجالصحافةخادم MCP
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

9 مستودعات

Awesome GitHub RepositoriesGrid Connectivity Solving

Tracks connectivity information across grid states using plug-based methods to solve path and tiling problems.

Distinct from Algorithmic Problem Solving: Focuses on plug-based DP, distinct from general algorithmic problem solving.

Explore 9 awesome GitHub repositories matching software engineering & architecture · Grid Connectivity Solving. Refine with filters or upvote what's useful.

Awesome Grid Connectivity Solving GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • azl397985856/leetcodeالصورة الرمزية لـ azl397985856

    azl397985856/leetcode

    55,758عرض على GitHub↗

    This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

    Implements depth-first search to identify and count connected components within 2D grids.

    JavaScriptalgoalgorithmalgorithms
    عرض على GitHub↗55,758
  • oi-wiki/oi-wikiالصورة الرمزية لـ OI-wiki

    OI-wiki/OI-wiki

    26,176عرض على GitHub↗

    This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

    Implements plug-based dynamic programming to solve complex grid connectivity and tiling problems.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    عرض على GitHub↗26,176
  • sharingsource/logicstack-leetcodeالصورة الرمزية لـ SharingSource

    SharingSource/LogicStack-LeetCode

    7,495عرض على GitHub↗

    LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

    Solves grid distance and state propagation problems using multi-source BFS.

    algorithminterview-practiceinterview-questions
    عرض على GitHub↗7,495
  • hybridgroup/gocvالصورة الرمزية لـ hybridgroup

    hybridgroup/gocv

    7,463عرض على GitHub↗

    GoCV is a computer vision library and Go language binding for OpenCV. It serves as an image processing toolkit and deep learning inference engine, providing programmatic access to a wide range of algorithms for image manipulation, object detection, and video analysis. The project differentiates itself through high-performance native bindings and hardware acceleration. It utilizes a foreign function interface to map Go calls to C++ functions and includes a hardware-agnostic backend dispatch to route neural network tasks to computation engines such as CUDA and OpenVINO. The library covers a br

    Labels and counts connected regions of pixels to separate distinct objects in binary images.

    Go
    عرض على GitHub↗7,463
  • shimat/opencvsharpالصورة الرمزية لـ shimat

    shimat/opencvsharp

    6,011عرض على GitHub↗

    OpenCVSharp is a .NET library that wraps native OpenCV functions, providing C# developers with access to OpenCV's computer vision capabilities through an API that mirrors the native C/C++ style. It serves as a managed wrapper for image processing, feature detection, object detection, and image manipulation tasks, while also handling automatic disposal of unmanaged OpenCV resources like Mat objects to prevent memory leaks in .NET applications. The library enables keypoint detection and descriptor extraction using algorithms such as AKAZE, BRISK, or FAST, with brute-force or FLANN-based matchin

    Labels connected regions of foreground pixels in binary images and returns blob properties.

    C#computer-visiondotnetdotnetstandard
    عرض على GitHub↗6,011
  • garnele007/swiftocrالصورة الرمزية لـ garnele007

    garnele007/SwiftOCR

    4,632عرض على GitHub↗

    SwiftOCR هي مكتبة Swift أصلية مصممة لاستخراج النصوص والأحرف الأبجدية الرقمية من الصور. تعمل كمميز نصوص للشبكة العصبية يحدد الأحرف والسلاسل من البيانات البصرية. تتضمن المكتبة مدرباً مخصصاً لنماذج OCR وأدوات للتعرف على الخطوط المخصصة. تسمح هذه القدرات بإنشاء شبكات عصبية متخصصة مصممة لخطوط ومجموعات أحرف معينة لتحسين دقة التعرف. يستخدم النظام تصنيف المكونات المتصلة لتحديد مناطق الأحرف الفردية ويستخدم معالجة الصور لتحويل الرموز الأبجدية الرقمية القصيرة إلى نص رقمي.

    Employs connected-component identification to locate individual character blobs in images.

    Swift
    عرض على GitHub↗4,632
  • memgraph/memgraphالصورة الرمزية لـ memgraph

    memgraph/memgraph

    4,163عرض على GitHub↗

    Memgraph is an in-memory, distributed graph database designed for high-performance labeled property graph management. It utilizes a Cypher query engine for declarative data retrieval and manipulation, providing a scalable knowledge graph backend that integrates vector search and graph traversals. The system distinguishes itself as a real-time graph analytics platform, employing native C++ and CUDA implementations to execute complex network analysis and dynamic community detection on streaming data. It provides specialized support for AI integration, including GraphRAG capabilities, the constr

    The product groups nodes into separate components where no edges exist between different groups.

    C++cyphergraphgraph-algorithms
    عرض على GitHub↗4,163
  • zxing-js/libraryالصورة الرمزية لـ zxing-js

    zxing-js/library

    2,917عرض على GitHub↗

    This library is a multi-format barcode processing utility designed for web browsers and server-side environments. It provides a comprehensive suite of tools for both decoding existing barcode symbols and generating new ones from input data. The project distinguishes itself by enabling continuous, real-time barcode scanning directly from live video streams. By utilizing browser camera interfaces and automated frame processing, it allows applications to capture and interpret one-dimensional and two-dimensional barcode data without requiring manual image uploads or user intervention. Beyond rea

    Analyzes pixel luminance to isolate high-contrast barcode patterns from background noise in raw image data.

    TypeScriptbarcodedecoding-imagesencoding-library
    عرض على GitHub↗2,917
  • marcosfede/algorithmsالصورة الرمزية لـ marcosfede

    marcosfede/algorithms

    1,132عرض على GitHub↗

    This project is a comprehensive repository of fundamental computer science algorithms and data structures designed as a reference for academic study, technical interview preparation, and competitive programming. It provides standardized implementations of core computational strategies, serving as an educational resource for developers to master software engineering fundamentals and algorithmic problem-solving. The collection distinguishes itself through a multi-language approach, offering cross-language solutions for complex tasks ranging from graph traversal and dynamic programming to bitwis

    Implements algorithms for identifying and counting contiguous regions of identical values in a grid.

    Pythonalgorithmbfscompetitive-programming
    عرض على GitHub↗1,132
  1. Home
  2. Software Engineering & Architecture
  3. Algorithmic Problem Solving
  4. Grid Connectivity Solving

استكشف الوسوم الفرعية

  • Boundary Connectivity AnalysisAlgorithms that identify cells connected to the grid border and find enclosed regions. **Distinct from Grid Connectivity Solving:** Distinct from Grid Connectivity Solving: focuses on boundary-connected region identification rather than plug-based DP for tiling.
  • Connected Component Identification1 وسم فرعيAlgorithms for identifying and counting contiguous regions of identical values in a grid. **Distinct from Grid Connectivity Solving:** Focuses on simple connectivity and component counting using DFS, whereas Grid Connectivity Solving focuses on plug-based DP for tiling.
  • Disconnected Component IdentificationAlgorithms for partitioning a graph into separate subgraphs where no edges exist between different groups. **Distinct from Connected Component Identification:** Distinct from Connected Component Identification: specifically identifies the lack of connectivity between groups in a graph context.
  • Multi-Source BFS Grid SolvingAlgorithms that start breadth-first search from multiple initial cells simultaneously to compute distances across a grid. **Distinct from Grid Connectivity Solving:** Distinct from Grid Connectivity Solving: focuses on multi-source BFS for distance propagation rather than plug-based DP for tiling.
  • Pursuit-Evasion GamesSimulates adversarial pursuit-evasion on a grid with turn-based moves and determines the outcome under optimal play. **Distinct from Grid Connectivity Solving:** Distinct from Grid Connectivity Solving: focuses on adversarial pursuit-evasion game outcomes, not connectivity tracking.