Search Results for "graph nodes" - Page 4
Sort By:
Showing 131 open source projects for "graph nodes"
View related business solutions-
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.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
Graph Portal
Software to build web portals using concepts of Graph Theory
Graph Portal allows to organize many types of data so that you can get the information you want in the easiest way possible. There are many use cases for this software, including: building a web portal, creating mind map, wiki, studying graph theory concepts and algorithms,content management etc. The application has built-in Lucene search, custom query, file attachment to nodes etc. -
2
vizceral
WebGL visualization for displaying animated traffic graphs
vizceral is a component for displaying traffic data on a webgl canvas. If a graph of nodes and edges with data about traffic volume is provided, it will render a traffic graph animating the connection volume between nodes. This component can take multiple traffic graphs and will generate a 'global' graph showing all incoming traffic into each of the 'regions', with support for cross-region traffic. There are three levels of information, global, regional, and service-level, with clicking or double-clicking on a node bringing you one level deeper. ... -
3
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
...It allows researchers and practitioners to apply node2vec to various graph datasets and evaluate embedding quality on downstream tasks. By bridging ideas from graph theory and word embedding models, this project demonstrates how graph-based machine learning can be made efficient and flexible. -
4
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). -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
Excel to Graphviz
Create graphviz diagrams with excel
Free, easy to use, excel tool to create data and process flow diagrams with table data In separate excel sheets you define items(nodes), lines(edges) and grouping(clusters) Separate definition of node, edge and cluster styles Graph settings sheet Output control sheet Examples and readme are included in the zip file Get it working: -Install graphviz (http://graphviz.org/Download.php) -Download Excel to Graphviz -Open one of the ExcelToGraphviz workbooks -Go to sheet settings and update "dotpath" to where graphviz' dot.exe was installed (e.g. ... -
6
GUI Chat Application
Graph data structure designed for social application
...The focus was on designing a suitable data structure that will efficiently deal with all the data needed for the application to function properly. The data structure chosen was a graph. Graph data structures are the most common structures used for social media application. Some of the data that needs to be handled are account details, friends lists, chats, messages and notifications. This data will all be stored in the graphs nodes. -
7
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file. The program was written in C++ using a main algorithm of a heap sorting. In this program, specifically users the codes for minimum heap since the purpose of the program is to find the minimum cost or path.
-
8
Brainstorm Network
Software to organize a brainstorm as a complex network.
This project aims to organize a brainstorm or a bibliographic revision in a network (graph). With this organization the users are able to visualize the main points of the brainstorm (the hubs in the network). Moreover, they can access the information through the rede, interactively, clicking on the edges or nodes! All information is associated with a reference list (imported from a bibtex file). This project uses Python, Web2py, MariaDB and VIS.js (D3.js). -
9
Toolkit for exporting/importing Maya scenes to/from OpenSceneGraph
-
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.
-
10
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 ). -
11
We consider a problem of finding maximum weight subgraphs (MWS) that satisfy hard constraints in a weighted graph. The constraints specify the graph nodes that must belong to the solution as well as mutual exclusions of graph nodes, i.e., pairs of nodes that cannot belong to the same solution. Our main contribution is a novel inference approach for solving this problem in a sequential monte carlo (SMC) sampling framework. Usually in an SMC framework there is a natural ordering of the states of the samples. ...
-
12
ThunderstormDistributor
Distribute jobs to compute nodes on dynamic clusters
ThunderstormDistributor is a queuing system that distributes jobs and computational workload across dynamic clusters in the cloud. It manages the assignment of jobs to maximize CPU and memory usage and prevent oversubscription of compute nodes. It also performs advanced statistics collection on individual compute nodes and jobs to graph the distribution of disk, network, CPU, and memory usage over time, which facilitates the advanced optimization and tuning of computational workflows. -
13
GraphVisu
A graph visualisation and exploration program
GraphVisu is a visualisation and exploration software for oriented graphs. It automatically and dynamically moves the graph nodes to ensure an efficient visualisation. In particular, it displays the hierarchy between nodes with mainly incoming links and nodes with mainly outcoming links. "Strongly connected components", that is parts of the graph without clear hierarchy, are also detected and displayed. GraphVisu has been originally developped to visualise the dependance relations within XSD files - a graph construction program for this specific case is available. -
14
3DScape is the first plug-in which enables three-dimensional network visualization in Cytoscape. 3DScape features include accessing graph appearance, layout algorithm, and animation effects on a series of expression data.
-
15
-
16
reco4j-neo4j
Reco4j is a graph-based recommendation engine, this is the neo4j impl
Reco4j is an open source project aims at developing a recommendation framework based on graph data sources. We choose graph databases for several reasons. They are NoSQL databases, so "schemaless". This means that it is possible to extend the basic data structure with intermediate information, i.e. similarity value between item and so on. Moreover, since every information is expressed with properties, nodes and relations, the recommendation process can be customized to work on every graph. ... -
17
reco4j-core
Reco4j is a graph-based recommendation engine
Reco4j is an open source project aims at developing a recommendation framework based on graph data sources. We choose graph databases for several reasons. They are NoSQL databases, so "schemaless". This means that it is possible to extend the basic data structure with intermediate information, i.e. similarity value between item and so on. Moreover, since every information is expressed with properties, nodes and relations, the recommendation process can be customized to work on every graph. ... -
18
This program is intended for clustering of nodes in graphs (i.e. dividing nodes of the graph into clusters). Several different genetic algorithms can be used to find the solution.
-
19
Diffusive
Task-oriented distributed computing framework
...In diffusive programming, any method can be marked for distribution, regardless of its signature. And marking a method is necessary and sufficient for its execution to be distributed. Distribution of tasks occurs through a network of nodes that can accept tasks and execute them, or forward them on. Nodes executing a task, load the required resources as needed, and cache them. The topology of the network of nodes can be anything that can be represented as a directed graph. Topologies can be tailored to solve specific problems. Diffusive is a Java refer- ence implementation of the six principles that define diffusive programming. -
20
python dagger
File dependency graph evaluator in pure python.
Dagger evaluates file dependencies in a directed-acyclic-graph (DAG) like GNU make, but timestamps or hashes can be used on a per-file basis when evaluating which file nodes are up to date or stale. Use fast timestamp comparisons on large files when hashing is too slow, and hashing on small files. When hashing is used, it's stored in either a text file or sqlite database (in-memory at runtime is optional). -
21
cZUI is a Zoomable User Interface framework, allowing the creation of zoomable interfaces in C++. It uses the scene graph concept, with the possibility of panning and zooming cameras on various parts of the scene. Multiple cameras can be painted on the same window, each with its own painting rectangle. Multiple demos and a tutorial are available.
-
22
flow is a cross-platform headers-only C++11 framework which provides the building blocks for streaming data packets through a graph of data-transforming nodes
-
23
graphseg
Library for segmenting a graph, images in particular.
Primarily this library was developed for producing a set of super-pixels from an image (i.e. an over-segmentation). The segmentation is produced by running multiple instances of Dijkstra's Algorithm from a set of seed points; those nodes which belong to a given Dijkstra cloud form a segment (so the number of segments is fixed and determined at the beginning of the algorithm). The goal is to add code that moves from the over-segmentation to a more useful segmentation. The library includes code specifically for the purpose of image segmentation but there are several components useful for general graph segmentation. -
24
Graph Database
A robust, reliable, user-friendly, and high-performance Graph Database
This is an academic project to build a graph database, supporting multiple users, with fully functioned data query, data manipulation and indexing mechanism. It is running in a distributed client-server mode. This project is assigned to final-year project from group IT121B, Bachelor of Computing, University of Wollongong. -
25
TikZ-dependency
A LaTeX library to draw all sorts of dependency trees and graphs
...The package has a very easy to learn, high level interface that can be used to draw simple dependency trees, complex non projective graphs, bubble parses, and in general any kind of graph which is based on a sequence of nodes and edges among these. It is based on PGF/TikZ and it can be used either with latex or pdflatex. It comes with a very comprehensive documentation that will get you started in 10 minutes, even without any prior knowledge of TikZ. It also provides a lot of styling facilities, to let you personalize the look and feel of the graphs at your liking.
