Search Results for "control flow graph" - Page 2

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

...By yielding promises (or thunks) inside a generator function, co resumes execution when the asynchronous work completes, eliminating deeply nested callbacks. It supports yielding arrays or objects of promises to run tasks concurrently, and it propagates errors naturally through try/catch, making control flow easier to reason about. The library arrived before async/await existed in Node.js and influenced how developers thought about structuring asynchronous programs. Even in a world with native async functions, co remains a concise illustration of cooperative concurrency and still works where generator syntax is preferred. Its API surface is intentionally tiny: wrap a generator, yield work, and let co drive the promise plumbing behind the scenes.

...The idea is to avoid introducing a separate DSL for templating and instead use familiar JavaScript logic inside template tags to generate dynamic content. You write templates using <% %> scriptlet tags, <%= %> for output, and you can include other templates, pass data, and control flow with loops and conditionals. It’s fast because it compiles templates to JavaScript functions and caches them by default, so subsequent rendering is efficient. EJS supports both server-side render (in Node/Express) and client-side use in the browser, making it versatile for universal apps. Because you’re using raw JS, debugging is simple—the errors are standard JS stack traces with template line numbers included. ...

...As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3

flow is a cross-platform headers-only C++11 framework which provides the building blocks for streaming data packets through a graph of data-transforming nodes

...Additionally, it provides a simple Java API to enable the construc- tion of IWIR workflows and the serialisation of IWIR Workflows as XML documents compliant to the IWIR XML Schema. The tool is able to parse and evaluate the IWIR condition expressions and will validate IWIR documents for correctness in their control flow, data flow, data types and syntax both when parsing existing IWIR XML documents as well as during the creation of new workflows using the API of IWIRtool.

...Based on gwt-html5-graph, the user may transplant very conveniently the eclipse platform development each kind of graph/modelling application to WEB on, also may develops the new WEB vector graph application based on formidable eclipse platform GEF API and EMF/UML2 API, like each kind of flow chart, engineering plat, UML modelling, GIS and so on. Demo1(GEF Sample): http://euml.trufun.net/drawx/gef-sample/Gef_sample.html

An Error Handler for C/C++ funtions, focused on code readability. It allows a clear control flow, adding Ignore, Retry, Jump, and Back functionality when a function returns error. It's macro based, written in C and targeting embedded systems.