Quick Sequence Diagram Editor - Example
Source text bfs:BFS[a] /queue:FIFO someNode:Node node:Node adjList:List adj:Node bfs:queue.new bfs:someNode.setLevel(0) bfs:queue.insert(someNode) [c:loop while queue != ()] bfs:node=queue.remove() bfs:level=node.getLevel() bfs:adjList=node.getAdjacentNodes() [c:loop 0 <= i < #adjList] bfs:adj=adjList.get(i) bfs:nodeLevel=adj.getLevel() [c:alt nodeLevel IS NOT defined] bfs:adj.setLevel(level+1) bf
Protovis
Protovis Protovis composes custom views of data with simple marks such as bars and dots. Unlike low-level graphics libraries that quickly become tedious for visualization, Protovis defines marks through dynamic properties that encode data, allowing inheritance, scales and layouts to simplify construction. Protovis is free and open-source, provided under the BSD License. It uses JavaScript and SVG
Animated Sorting Algorithms
Discussion These pages show 8 different sorting algorithms on 4 different initial conditions. These visualizations are intended to: Show how each algorithm operates. Show that there is no best sorting algorithm. Show the advantages and disadvantages of each algorithm. Show that worse-case asymptotic behavior is not the deciding factor in choosing an algorithm. Show that the initial condition (inp
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}