Search Results for "dfs"
Sort By:
Showing 22 open source projects for "dfs"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch 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.
-
Our Free Plans just got better! | Auth0You 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.
-
1
Computer Science Flash Cards
Mini website for testing both general CS knowledge and enforce coding
...They are designed for spaced-repetition style study so you can cycle frequently through fundamentals until recall feels automatic. Many cards point at canonical definitions or contrasts (e.g., stack vs. queue, BFS vs. DFS) to strengthen conceptual boundaries. The material favors clarity and breadth over exhaustive proofs, making it ideal for quick refreshers during a study plan. It complements longer resources by giving you a lightweight way to keep key concepts top of mind. -
2
Apache Hudi
Upserts, Deletes And Incremental Processing on Big Data
Apache Hudi (pronounced Hoodie) stands for Hadoop Upserts Deletes and Incrementals. Hudi manages the storage of large analytical datasets on DFS (Cloud stores, HDFS or any Hadoop FileSystem compatible storage). Apache Hudi is a transactional data lake platform that brings database and data warehouse capabilities to the data lake. Hudi reimagines slow old-school batch data processing with a powerful new incremental processing framework for low latency minute-level analytics. -
3
Featuretools
An open source python library for automated feature engineering
An open source Python framework for automated feature engineering. Featuretools automatically creates features from temporal and relational datasets. Featuretools uses DFS for automated feature engineering. You can combine your raw data with what you know about your data to build meaningful features for machine learning and predictive modeling. Featuretools provides APIs to ensure only valid data is used for calculations, keeping your feature vectors safe from common label leakage problems. You can specify prediction times row-by-row. ... -
4
CXXGraph
Header-Only C++ Library for Graph Manipulation and Algorithms
CXXGraph is a small library, header only, that manages the Graph and it's algorithms in C++. In other words a "Comprehensive C++ Graph Library". -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
-
6
Tera
An Internet-scale database
...Tera is the collection of many sparse, distributed, multidimensional tables. The table is indexed by a row key, column key, and a timestamp; each value in the table is an uninterpreted array of bytes. Support RAMDISK/SSD/DFS tiered cache. Block cache and Bloom Filters for real-time queries. Multi-type table support (RAMDISK/SSD/DISK table). Easy to use C++/Java/Python/REST-ful API. Column-oriented storage and locality group support. Ranged and hashed sharding strategies. -
7
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
8
Algorithms in Python
Data Structures and Algorithms in Python
Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational... -
9
(RoboSim) Robot Simulator
(RoboSim) Java based Robot Localization and Path Planner Simulator.
...Source : https://github.com/habsoft/robosim Blog : https://robosimblog.wordpress.com Note : Use jre 1.7 to run it. 1.Histogram Filter 2.Histogram Filter with Sonar Range Finder (Experimental) 3.Kalman Filter 4.Particles Filter 5.Path Planning 6.Path Smoothing 7.PID Controller Path Planning Algorithms 1.BFS 2.DFS 3.A Star 4. Dynamic Programming Heuristics i. Euclidean Distance ii. Euclidean Distance(+) iii. Euclidean Distance(*) iv. Euclidean Distance Squared v. Manhattan Distance vi. Chebyshev Distance -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
A educational Java software featuring a graph editor and algorithms animation to learn how the algorithms work. Algorithms: Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (Prim), Single-Source Shortest Path (Dijkstra), Maximum Flow (Edmonds-Karp).
-
11
FastDFS is an open source high performance DFS ( distributed file system ). It's major functions include: file storing, file syncing and file accessing, and design for high capacity and load balancing.
-
12
Vrigazov Chess Engine
Chess engine, currently in development
Basic chess engine with implemented rules and DFS search in the graph of positions. -
13
RuzzleSolver
Takes in a ruzzle input and solves it
...An automatic swiper that in conjunction with Bluestacks lets you swipe every possible word thereby getting an insanely high score ! How does it work ? 1. Runs a DFS on the Ruzzle grid and at each instance checks if the word formed is a valid one. 2. Since the size of a grid is just 4 x 4, optimizations (such as using a suffix tree) aren't that important. 3. The total list of possible words is obtained fairly quickly. Less than 10 seconds on an i7 machine (without using any form of parallelization or multithreading). 4. ... -
14
Jxtadoop
This project aims to provide P2P capabilities with Hadoop DFS.
...This project focuses on the Distributed File System part of Hadoop (HDFS). The goal of this project is to provide an alternative to direct IP connectivity required for Hadoop. Instead, the DFS layer has been modified to use a Peer-2-Peer framework which allows direct connectivity in datacenters as well as indirect connectivity to bypass firewall constraints. The typical use case is the use of servers in various DMZs with hundreds of gigabytes of data not used which can be leveraged to provide a massive storage cloud for Hadoop. ... -
15
bridgeandtorch
517 Yapay Zeka dersi için (Engin Y.)
“Bridge and torch” probleminin yapay zeka ile çözümünü yapan Java/C#/C/Prolog Programını yazınız (30). BFS, DFS, A* veya diğer bir yöntemi (constructive/iterative) tercih edebilirsiniz. -
16
BloxorzSolver
solver bloxorz
in my AI course i'm solve this problem with java for level one and two and three and six .in BFS DFS DLS IDS -
17
GrAMP
Graph Algorithm in MetaPost
A software tool to make easily graph algorithm illustrations in MetaPost. The resulting MetaPost-files can e.g. be incorporated in LaTeX-documents. -
18
-
19
Cgraph simulator is a tool to simulate common graph algorithms like bfs,dfs etc specially designed for algorithm learners. For detailed info visit: http://www.shafaetsplanet.com/cgraph/
-
20
Distributed file system for cluster. Includes messaging layer library, client application, demon for processing messages from client.
-
21
A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.
-
22
boost_graph tried to wrap the C++ Boost Graph library in Python, providing graph algorithms like Breadth First Search, DFS, Shortest Path, Topological sort. This project is dead (http://bayleshanks.com/pamv1)
- Previous
- You're on page 1
- Next