I think what you are looking for is generally called a Flood Fill. It is up to you whether you traverse the graph through a BFS or a DFS. Basically you take an unlabeled (AKA uncoloured) node and assign a new label to it. You assign the same label to all nodes adjacent to that … Read more
Options can be set separately for each series. var chart = new Highcharts.Chart({ chart: { renderTo: ‘container’ }, xAxis: { type: ‘datetime’ }, series: [{ name: ‘John’, color: ‘#0066FF’, dashStyle: ‘ShortDash’, data: [ [Date.UTC(2010, 0, 1), 29.9], [Date.UTC(2010, 2, 1), 71.5], [Date.UTC(2010, 3, 1), 106.4] ] },{ name: ‘Mary’, color: ‘#FF0000’, data: [ [Date.UTC(2010, 0, … Read more
JavaScript InfoVis Toolkit is awesome and i have not seen a competitor to it.
We have a social graph in which in a day we add almost 1 millions of node and twice as many edges. We started with neo4j graph because yes, it is very fast due to fact that its storage is on the same machine on which graph engine runs. But following are the experiences that … Read more
Both are valid DFS algorithms. A DFS does not specify which node you see first. It is not important because the order between edges is not defined [remember: edges are a set usually]. The difference is due to the way you handle each node’s children. In the iterative approach: You first insert all the elements … Read more
Yes, you are right. The concept of MST allows weights of an arbitrary sign. The two most popular algorithms for finding MST (Kruskal’s and Prim’s) work fine with negative edges. Actually, you can just add a big positive constant to all the edges of your graph, making all the edges positive. The MST (as a … Read more
graphviz is a tool for generating graphs. webgraphviz.com is a web app that uses graphviz, and lets you modify the text and display the corresponding graph (it has 5 samples/examples as well). graphviz takes input like this: digraph G { A->B }
Looks like Nodebox might be what you want: http://nodebox.net/code/index.php/Graph Mac OSX http://www.cityinabottle.org/nodebox/ Windows (using OpenGL) The graph object has functionality for mouse interaction as well, bundled in the graph.events object. It has the following properties: graph.events.hovered: None or the node over which the mouse hovers. graph.events.pressed: None or the node on which the mouse is … Read more
Breadth-first search is just Dijkstra’s algorithm with all edge weights equal to 1. Dijkstra’s algorithm is conceptually breadth-first search that respects edge costs. The process for exploring the graph is structurally the same in both cases.