Search Results for "edge"

The hsdar package contains classes and functions to manage, analyse and simulate hyperspectral data. These might be either spectrometer measurements or hyperspectral images through the interface of rgdal.

Visit our new site: http://socnetv.org Social Network Visualizer (SocNetV) is a social network analysis and visualization application. You can draw a social network (graph/digraph) or load an existing one (GraphML, UCINET, Pajek, etc), compute cohesion, centrality, community and structural equivalence metrics and apply various layout algorithms based on actor centrality or prestige scores (i.e. Eigenvector, Betweenness) or on dynamic models (i.e. Kamada-Kawai spring-embedder)

Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library.

Blueprint XAS is a Matlab-based suite designed for the processing and analysis of near-edge x-ray absorption spectroscopy (XAS) data. The suite is designed primarily to assist users in exploring reasonable fit solutions while minimizing user bias.

... - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. ...

as3delaunay is an ActionScript 3 library that provides an implementation of Delaunay triangulation and Voronoi diagram generation. It is based on the well-known work of Raymond Hill and offers developers an efficient way to create and manipulate geometric structures for use in Flash and other AS3-based environments. The library enables users to generate Voronoi diagrams from a set of input points, allowing applications such as procedural map generation, image segmentation, and spatial...

ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina

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.

A topological data structure to handle 2D simplicial meshes (using the Morse operators published by authors). This data structure is implemented using C++ and it is based on the classical Half-Edge. This code started in 2002 and it has been used in many

Triangle mesh tool and library. Primary features include generation from mathmatical equation, decimation or edge reduction, clipping, and interactive viewer.

hgboost is a header-only library which contains a generic hypergraph implementation and provides vertex/node contraction and vertex/edge filtering. It contains algorithms to compute cohesive subgroups, minimum cuts and maximum flows.

The Physicist is a high end physics simulation engine that can provide answers with reasonable accuracies(now w/ rk4 and euler options). It can currently predict the motion of many particles.It Employs OpenGL to provide cutting edge graphics support.

A java based neural network framework. The Auratus network is built around an XML messaging system, allowing for a complete MVC design. Additionally, Auratus networks are constructed and at the node/edge level, allowing for advanced topologies.

with nodeCol you can create nodes and connect them with edges. then the script checks if there is a possibility to colorize the nodes with a specific number of colors without having two nodes, connectet with one edge, getting the same color.

...Usefulness is primarily in graph theory, also for some computer science problems. Test for preservation of adjacency in a graph over various functions. Sample graphs included, or enter your own edge and vertex sets.