Procedures that work on graphs, the networks of points joined by links. Dijkstra's algorithm finds the shortest paths from one point to all others in a weighted graph such as a road network, and topological sorting orders the points of a directed graph so that every link runs forward, which is how tasks with prerequisites are scheduled. Both are standard tools in routing, planning and build systems.
Graph Algorithms
Filter Results1 entry
Sources
Wikipedia: PageRank
Wikimedia FoundationHas Member: PageRank, LeadQuote, Has Member: PageRank, Lead
PageRank (PR) is an algorithm used by Google Search to rank web pages
Havel-Hakimi algorithm (Wikipedia)
Has Member: Havel-Hakimi algorithm, Lead sentenceQuote, Has Member: Havel-Hakimi algorithm, Lead sentence
is an algorithm in graph theory solving the graph realization problem.
Chaitin's algorithm (Wikipedia)
Has Member: Chaitin's algorithm, Lead, graph coloringQuote, Has Member: Chaitin's algorithm, Lead, graph coloring
bottom-up, graph coloring register allocation algorithm
PQ tree (Wikipedia)
Has Member: PQ tree, Lead, applicationsQuote, Has Member: PQ tree, Lead, applications
Applications of PQ trees include creating a contig map from DNA fragments, testing a matrix for the consecutive ones property, recognizing interval graphs, and determining whether a graph is planar.
Graph drawing (Wikipedia)
Has Member: Graph drawing, LeadQuote, Has Member: Graph drawing, Lead
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization
Wikipedia: Dijkstra's Algorithm
Wikimedia FoundationHas Member: Dijkstra's Algorithm, LeadQuote, Has Member: Dijkstra's Algorithm, Lead
Dijkstra's algorithm (, DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network.
Wikipedia: Topological Sort
Wikimedia FoundationHas Member: Topological Sort, LeadQuote, Has Member: Topological Sort, Lead
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.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.