Search Results for "graphs"

...The modular design of miniaudio allows you to use the low-level API without compromising your ability to make use of other features like the node graph and resource manager. miniaudio's node graph system gives you an easy way to set up advanced mixing and effect graphs. Each node sends it's output to another node, and so on and so forth to produce all kinds of effects. You can even implement your own custom nodes and plug them in however you like. Plug multiple nodes into the same input node for mixing and use the splitter node for complex routing.

...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 allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w. ...

Competent Audio (CA) is an audio engine suitable for video games. It is written in C, but is designed for interoperability with other languages. Windows and Linux binaries for x86 and amd64 are available. CA uses a machine graph model with support for arbitrary numbers of machines, limited only by the available system resources: - Samplers play back audio clips. - Mixers combine audio signals and optionally perform signal processing. - Sinks send audio signals to an output...

C ADT(Abstract Data Types) is a simple template library written in C which implements commonly used abstract data structures, such as linked lists, trees, queues, stacks, hashes, graphs and associated algorithms.