Here is a JavaScript code snippet to generate CSS hsl color code from [0, 1] value function heatMapColorforValue(value){ var h = (1.0 – value) * 240 return “hsl(” + h + “, 100%, 50%)”; } This algorithm is based on the 5 color heatmap, In this algorithm, the colors corresponding with values are 0 : … Read more
You might check out how Martin Erwig’s Haskell functional graph library does things. For instance, its shortest-path functions are all pure, and you can see the source code for how it’s implemented. Another option, like fmark mentioned, is to use an abstraction which allows you to implement pure functions in terms of state. He mentions … Read more
Consider a graph like this: A—(3)—–B | | \-(1)-C–(1)/ The shortest path from A to B is via C (with a total weight of 2). A normal BFS will take the path directly from A to B, marking B as seen, and A to C, marking C as seen. At the next stage, propagating from … Read more
import networkx as nx import numpy as np import matplotlib.pyplot as plt G = nx.Graph() G.add_edges_from( [(‘A’, ‘B’), (‘A’, ‘C’), (‘D’, ‘B’), (‘E’, ‘C’), (‘E’, ‘F’), (‘B’, ‘H’), (‘B’, ‘G’), (‘B’, ‘F’), (‘C’, ‘G’)]) val_map = {‘A’: 1.0, ‘D’: 0.5714285714285714, ‘H’: 0.0} values = [val_map.get(node, 0.25) for node in G.nodes()] nx.draw(G, cmap=plt.get_cmap(‘viridis’), node_color=values, with_labels=True, font_color=”white”) … Read more
To save time those eager to try existing programs handling DOT graphs: dotty can display DOT graphs and with little luck you can move its nodes with a mouse, nothing more, and you can easily segfault as a bonus (I tried latest stable graphviz) lefty is only a special-purpose language interpreter used by dotty, nothing … Read more
An augmenting path is a simple path – a path that does not contain cycles – through the graph using only edges with positive capacity from the source to the sink. So the statement above is somehow obvious – if you can not find a path from the source to the sink that only uses … Read more
Computer Networks: Graphs model intuitively model computer networks and the Internet. Often nodes will represent end-systems or routers, while edges represent connections between these systems. Data Structures: Any data structure that makes use of pointers to link data together is making use of a graph of some kind. This includes tree structures and linked lists … Read more
Although an answer has been posted (and accepted), I thought there is no harm in posting what I worked upon this problem last night. I approached this problem more from a novice point of view rather than working out with existing algorithms of graph/tree traversal. My first attempt is rendering this by levels from the … Read more
This actually looks like a job that the double entry accounting concept could help with. Your transactions could be structured as bookkeeping entries thus: Alice Bill Charles Balance Alice -> Bill $10 10 10- 0 0 Bill -> Alice $1 9 9- 0 0 Bill -> Charles $5 9 4- 5- 0 Charles -> Alice … Read more