Tags: general |

Shared by: joubin |

Created on: Jan 07 2018 (Sun) @ 07:40 AM |

In the field of computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another. In this application, a topological ordering is just a valid sequence for the tasks. |

About |
MyKardz © by PageFragments Inc. (2016 - 2018)

Terms of Use: MyKardz is not responsible, nor does it grant any licenses to third party content and file attachments. The content of each card is the responsibility of the individual users of MyKardz.