.NET WinForms NodeGraph Control

  •        225

NodeView is a lightweight C# Windows Forms Control that allows to design & create Editable Node Trees in your application.

http://nodegraph.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

NodeGraph - Node graph created by matlab


Node graph created by matlab

ngraph.forcelayout3d - Force directed graph layout in 3d


First of all it's worth to mention all force directed algorithms are iterative. We need to perform multiple iterations of an algorithm, before graph starts looking aesthetically pleasing.With that in mind, the easiest way to make graph look nice is:``` js// graph is an instance of `ngraph.graph` object.var layout = require('ngraph.forcelayout3d')(graph); for (var i = 0; i < ITERATIONS_COUNT; ++i) { layout.step();}// now we can ask layout where each node/link is best positioned:graph.forEachNode

ngraph.forcelayout - Force directed graph layout


First of all it's worth to mention all force directed algorithms are iterative. We need toperform multiple iterations of an algorithm, before graph starts looking aesthetically pleasing.With that in mind, the easiest way to make graph look nice is:``` js// graph is an instance of `ngraph.graph` object.var layout = require('ngraph.forcelayout')(graph); for (var i = 0; i < ITERATIONS_COUNT; ++i) { layout.step();}// now we can ask layout where each node/link is best positioned:graph.forEachNode(fu

shortestpath - Shortest path in directed unweighted graph from one node to other node


Shortest path in directed unweighted graph from one node to other node

Social-Graph-Node-Mapper-JSON-API


The Social Graph Node Mapper JSON API is an extension of Google's Social Graph Node Mapper making it available as a public API.



facebook-graph-node - simple facebook graph client for node


simple facebook graph client for node

node-loggly-graphs - Example of using node-loggly to graph using facet call.


Example of using node-loggly to graph using facet call.

GraphNode - Generic graph structure using a single object for both graph and node behavior.


Generic graph structure using a single object for both graph and node behavior.

bezier - Bezier curves. Computer graph #1 lab


Bezier curves. Computer graph #1 lab

gotgf - TGF, the "Trivial Graph Format", parser in Go.


```gopackage mainimport ( "fmt" "github.com/didip/gotgf")func main() { allNodes, rootNodes, _, err := tgf.ParseFile("example.tgf") if err != nil { panic(err) } fmt.Println("Root Nodes: ", rootNodes, "\n") for index, node := range allNodes { fmt.Println("Node ID:", node.Id) fmt.Println("Node Label:", node.Label) if index == "1" || index == "3" || index == "4" { fmt.Println("Node OutboundEdges", node.OutboundEdges(), "\n") } if index == "2" || index == "4" || index == "5"

Facebook-Graph-API - A node module for making requests to the Facebook Graph API


A node module for making requests to the Facebook Graph API

WeightedGraphMax_SavedPath


This Hadoop MapReduce program operates on a directed graph, in adjacency list format. The program computes the maximum total of node weights, from top to bottom of the directed graph, and records the path taken to get to the maximum total node weight, by performing a breadth-first graph search using an iterative map-reduce algorithm.

jhlivingstone-WeightedGraphMax_SavedPath


This Hadoop MapReduce program operates on a directed graph, in adjacency list format. The program computes the maximum total of node weights, from top to bottom of the directed graph, and records the path taken to get to the maximum total node weight, by performing a breadth-first graph search using an iterative map-reduce algorithm.

panther - Discover artists through an infinite node graph


Discover artists through an infinite node graph

UnitGraph - Lightweight Graph Library for Node 4.x


Lightweight Graph Library for Node 4.x

pregel - Single-node implementation of Google's Pregel framework for graph processing.


Single-node implementation of Google's Pregel framework for graph processing.

elsewhere - A node project that aims to replicate the functionality of the Google Social Graph API


A node project that aims to replicate the functionality of the Google Social Graph API

little-alchemy - Node graph where I keep track of all the Little Alchemy recipes I have so far


Node graph where I keep track of all the Little Alchemy recipes I have so far

task-group - Node module to run a graph of tasks


Node module to run a graph of tasks