Scribd Logo
Importer

Bienvenue sur Scribd !

  • Computer Science Directed Graph Vertices: Topological Sort or Topological Ordering of A

    Transféré par

    Jaswinder
    203 vues25 pages
    A TOPOLOGICAL SORT is a linear ordering of its vertices such that, for every edge uv, u comes before v in the ordering. Topological ordering is possible if and only if the graph has no directed cycles.

    Description originale:

    Titre original

    topological

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Formats disponibles

    PPT, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    A TOPOLOGICAL SORT is a linear ordering of its vertices such that, for every edge uv, u comes before v in the ordering. Topological ordering is possible if and only if the graph has no directed cycles.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme PPT, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    203 vues25 pages

    Computer Science Directed Graph Vertices: Topological Sort or Topological Ordering of A

    Transféré par

    Jaswinder
    A TOPOLOGICAL SORT is a linear ordering of its vertices such that, for every edge uv, u comes before v in the ordering. Topological ordering is possible if and only if the graph has no directed cycles.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme PPT, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 25

    TOPOLOGICAL SORT

    In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, 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. 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.
    Jasvinder Singh, jasvinder.singh13@rediffmail.com
    1

    Topological Sort: DFS


    C

    F H

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A)

    F H

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D)

    F H

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D) dfs(E)


    G A B

    F H

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D) dfs(E) dfs(F)


    G A B

    F H

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D) dfs(E) dfs(F) dfs(H)

    F H

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D) dfs(E) dfs(F)


    G A B

    F H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D) dfs(E)


    G A B

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    Topological Sort: DFS


    C

    dfs(A) dfs(D)

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    10

    Topological Sort: DFS


    C

    dfs(A) dfs(D)

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    11

    Topological Sort: DFS


    C

    dfs(A)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    12

    Topological Sort: DFS


    C

    dfs(A)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    13

    Topological Sort: DFS


    C

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    14

    Topological Sort: DFS


    C

    dfs(B)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    15

    Topological Sort: DFS


    C

    dfs(B)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    16

    Topological Sort: DFS


    C

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    17

    Topological Sort: DFS


    C

    dfs(C)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    18

    Topological Sort: DFS


    C

    dfs(C)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    19

    Topological Sort: DFS


    C

    dfs(C)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    20

    Topological Sort: DFS


    C

    dfs(C)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    21

    Topological Sort: DFS


    C

    dfs(C) dfs(G)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    22

    Topological Sort: DFS


    C

    dfs(C)

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    23

    Topological Sort: DFS


    0 C

    D 4

    H 7

    Jasvinder Singh, jasvinder.singh13@rediffmail.com

    24

    Topological Sort: DFS


    0 C

    D 4

    H 7

    Topological order: C G B A D E F H
    Jasvinder Singh, jasvinder.singh13@rediffmail.com
    25

    Vous aimerez peut-être aussi