We're blogging machines!
Subscribe to feed
‹ New Developments in Iterated Prisoner’s Dilemma • “Clustering via Dirichlet Process Mixture Models for Portable Skill Discovery” ›
November 20, 2012 in Math by hundalhh | Permalink
Given a directed a-cyclic graph (DAG) find an ordering of the nodes which is consistent with the directed edges. This is called Topological Sorting and several algorithms exist.
Powered by WordPress and Tarski