GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Embed Notice

HTML Code

Corresponding Notice

  1. Embed this notice
    Axel Rauschmayer (rauschma@fosstodon.org)'s status on Friday, 17-May-2024 01:30:08 JSTAxel RauschmayerAxel Rauschmayer

    Math topics that keep being useful for programming: relations, orders, graphs.

    Example: You have plugins with conditions such as “plugin A must run before plugin B“.

    – These conditions define a partial order: In general, not every plugin can be “compared” with every other plugin.
    – If we want to sort an Array with plugins, we need a total order.
    – One algorithm that works with a partial order is topological sorting: https://en.wikipedia.org/wiki/Topological_sorting

    In conversationFriday, 17-May-2024 01:30:08 JST from fosstodon.orgpermalink

    Attachments

    1. Domain not in remote thumbnail source whitelist: upload.wikimedia.org
      Topological sorting
      In 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 (u,v) 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. Precisely, a topological sort is a graph traversal in which each node v is visited only after all its dependencies are visited. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG). Any DAG has at least one topological ordering, and algorithms are known for constructing a topological ordering of any DAG in linear time. Topological sorting has many applications, especially in ranking problems such as feedback arc set. Topological sorting is possible even when the DAG has disconnected components. Examples The canonical application of...
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.