Topological Sort

Ugliest Unicorn answered on July 25, 2022 Popularity 10/10 Helpfulness 1/10

answer Topological Sort

related What is topological sort?

Topological Sort

Comment

import java.util.Map;
import java.util.Queue;
import java.util.List;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.ArrayDeque;

private static String[] topologicalSort(Map<String, String[]> digraph) {
    // digraph is a map:
    //   key: a node
    // value: an array of adjacent neighboring nodes

    // construct a hash mapping nodes to their indegrees
    Map<String, Integer> indegrees = new HashMap<>();
    for (String node : digraph.keySet()) {
        indegrees.put(node, 0);
    }
    for (Map.Entry<String, String[]> entry : digraph.entrySet()) {
        String node = entry.getKey();
        for (String neighbor : entry.getValue()) {
            indegrees.put(neighbor, indegrees.get(neighbor) + 1);
        }
    }

    // track nodes with no incoming edges
    Queue<String> nodesWithNoIncomingEdges = new ArrayDeque<>();
    for(Map.Entry<String, Integer> entry : indegrees.entrySet()) {
        if (entry.getValue() == 0) {
            nodesWithNoIncomingEdges.add(entry.getKey());
        }
    }

    // initially, no nodes in our ordering
    List<String> topologicalOrdering = new ArrayList<>();
    
    // as long as there are nodes with no incoming edges that can be
    // added to the ordering
    while (nodesWithNoIncomingEdges.size() > 0) {

        // add one of those nodes to the ordering
        String node = nodesWithNoIncomingEdges.poll();
        topologicalOrdering.add(node);

        // decremenet the indegree of that node's neighbors
        for (String neighbor : digraph.get(node)) {
            indegrees.put(neighbor, indegrees.get(neighbor) - 1);
            if (indegrees.get(neighbor) == 0) {
                nodesWithNoIncomingEdges.add(neighbor);
            }
        }
    }

    // we've run out of nodes with no incoming edges
    // did we add all the nodes or find a cycle? 
    if (topologicalOrdering.size() != digraph.size()) {
        throw new IllegalArgumentException("Graph has a cycle! No topological ordering exists.");
    }

    return topologicalOrdering.toArray(new String[topologicalOrdering.size()]);
}

Popularity 10/10 Helpfulness 1/10 Language java

Source: www.interviewcake.com

Tags: java topological-sort

Link to this answer
Share Copy Link

Contributed on Sep 26 2023

Ugliest Unicorn

0 Answers Avg Quality 2/10

Closely Related Answers

What is topological sort?

Comment

Topological sort: 
outlines all the paths from point A to point B in a directed acyclic graph. 
Answers the question can I go from point A to point B and if yes, how?
C-> A ->B ->D
you CAN go from C to A
you CAN go from A to D
you CANNOT go from D to C

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: whatever whateve

Link to this answer
Share Copy Link

Contributed on Jul 25 2022

Javasper

0 Answers Avg Quality 2/10

Topological Sort

Contents

More Related Answers

Topological Sort

Closely Related Answers

What is topological sort?

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.