Search Results for "function graph"

...The headers are intended to be readable, so look at them too for usage information on each function and class.

Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that...

Plumbing is a general-purpose Clojure utility belt and data transformation library endorsed for its pragmatic approach to everyday tasks. It offers a toolkit of macros and functions that simplify common data manipulation patterns, and includes a “Graph” abstraction for structured computation flows. Most of it is also compatible with ClojureScript. Graph is a simple and declarative way to specify a structured computation, which is easy to analyze, change, compose, and monitor. Here's a simple example of an ordinary function definition, and its Graph equivalent. A Graph encodes the structure of a computation, but not how it happens, allowing for many execution strategies. ...

...The tool offers multiple analysis modes that answer questions like why a function is present, how much space it consumes, and what dependencies pull it into the final binary. By surfacing insights about symbol sizes and call relationships, Twiggy enables developers to optimize builds, remove dead code, and improve load times.

A graph implementation based entirely on functions. This text is about the implementation of a Go tool based entirely on functions – the API contains only immutable data types, and the code is built on top of a struct with five function fields. It’s a tool for building virtual graphs. In a virtual graph no vertices or edges are stored in memory, they are instead computed as needed.

...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

This tool converts the output of gprof to a format processible by the DOT tool, to generate a nice graphical function call graph.

Functrace is a tracing facility, similar to ltrace/strace, that can be used for tracing the dynamic call graph internal to a running program (i.e. a trace of function calls).