Showing 3 open source projects for "hexagon"

View related business solutions
  • Never Get Blocked Again | Enterprise Web Scraping Icon
    Never Get Blocked Again | Enterprise Web Scraping

    Enterprise-Grade Proxies • Built-in IP Rotation • 195 Countries • 20K+ Companies Trust Us

    Get unrestricted access to public web data with our ethically-sourced proxy network. Automated session management and advanced unblocking handle the hard parts. Scale from 1 to 1M requests with zero blocks. Built for developers with ready-to-use APIs, serverless functions, and complete documentation. Used by 20,000+ companies including Fortune 500s. SOC2 and GDPR compliant.
    Get Started
  • Auth0 Free: 25K MAUs + 5-Min Setup Icon
    Auth0 Free: 25K MAUs + 5-Min Setup

    Enterprise Auth, Zero Friction: Any Framework • 30+ SDKs • Universal Login

    Production-ready login in 10 lines of code. SSO, MFA & social auth included. Scale seamlessly beyond free tier with Okta’s enterprise security.
    Get Your API Keys
  • 1

    AI Path

    AI Pathfinding Presentation

    Presentation of pathfinding algorithms Howto: 1. Create Map (manual or use Map -> Rapid Deployment) 2. Select start point 3. Select end point 4. Choose alg 5. Click Path -> Find
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    This a NetBeans project developed to create a small Hexagon map library with a few basic functionalities. It is possible to measure distance between tiles's centres and calculate the best path between two of them (if any). It is possible to define tiles where it is not possible to pass (or reenabling them) by right clicking on them (they will become red), creating therefore obstacles that can help testing the path finding algorithm. This library is licences under GPL licence.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Create hexagon-based mind maps with content-related suggestions retrieved from the Internet.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next