Showing 7 open source projects for "squid-graph"

View related business solutions
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • $300 Free Credits for Your Google Cloud Projects Icon
    $300 Free Credits for Your Google Cloud Projects

    Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

    Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
    Start Free Trial
  • 1
    DIG

    DIG

    A library for graph deep learning research

    The key difference with current graph deep learning libraries, such as PyTorch Geometric (PyG) and Deep Graph Library (DGL), is that, while PyG and DGL support basic graph deep learning operations, DIG provides a unified testbed for higher level, research-oriented graph deep learning tasks, such as graph generation, self-supervised learning, explainability, 3D graphs, and graph out-of-distribution.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Graphython

    Graphython

    Free software for making graph.

    Graph making software which is available for free.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Implicit Graph Search Library
    Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Chemin Optimal

    Chemin Optimal

    allow to Find the optimal path using FORD algorithm

    Chemin optimal allows to draw nodes on a scene and link them with Arcs. You can affect values to each arc (the path's length). By clicking the launch button, chemin optimal show you the optimal path of the graphs using FORD algorithm. All operations are shown step by step. You can export the scene to a XML file. You can also load scene freom existing XML file. Chemin optimal check errors automatically before finding the minimal path. Chemin optimal is written in JAVA( JAVAFX ).
    Downloads: 0 This Week
    Last Update:
    See Project
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 5
    An efficient and easy-to-use C++ library containing classes to represent and manipulate graphs and digraphs. Additional vertex and edge/arc property structures are provided that can be synchronized with the graph structure dynamically.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    Aim is to extract the information from the cadastral maps which is stored as scanned images. The extracted information is stored using graph representation. Then we convert these infomation in to CityGML format to visualize and communicate.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Path Partitioner

    Path Partitioner

    Finds bad examples for the local search Path Partitioning algorithm

    Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo