Discussion on Strongly connected components
-
Updated
Aug 13, 2017 - C++
Discussion on Strongly connected components
KMM: parallel dataflow scheduler and efficient memory management for multi-GPU platforms
Graphs are used in Google maps,Facebook friends, friends of friends, Pipeline connection, electricity connections, shortest path etc.Also providing LAN connections between nodes and in VPN too.Specially spanning tree is used in these networks. visit it: https://image1.slideserve.com/2884352/ch-15-graph-theory-some-practical-uses-n.jpg visit it: h…
A modular and efficent implementation of the Trapezoidal Map algorithm without the use of pointers or dinamic allocation.
A computational geometry project that implements algorithms for constructing and querying trapezoidal maps
Neural Networks for learning with structured data types
Codebase to calculate DAG of tasks with user interface included. Memory efficient solution using DFT.
Dependency-aware obfuscation algorithm through randomized operation shuffling.
Header only C++ lib for collaborative CPU-GPU task graph execution
An implementation of a trapezoidal map.
System that finds the critical path of the graph of the disciplines of the Computer Science course at UnB (University of Brasília).
QuickDataFlow library is designed for messaging between programs written in c++ and python
Efficient C++ implementations of different fast algorithms for Minimum Path Cover
Task Scheduling For Heterogeneous Computing System
Code for the paper "Latency-Aware Generation of Single-Rate DAGs from Multi-Rate Task Sets" (RTAS 2020)
Add a description, image, and links to the dag topic page so that developers can more easily learn about it.
To associate your repository with the dag topic, visit your repo's landing page and select "manage topics."