|
gptkbp:instanceOf
|
gptkb:algorithm
|
|
gptkbp:appliesTo
|
gptkb:Graph_(data_structure)
|
|
gptkbp:canBe
|
Parallel
Deterministic
Distributed
Non-deterministic
|
|
gptkbp:complexity
|
Varies by algorithm
|
|
gptkbp:fieldOfStudy
|
gptkb:Discrete_Mathematics
Computer Science
|
|
gptkbp:hasApplication
|
gptkb:artificial_intelligence
gptkb:Bioinformatics
gptkb:Game_Theory
Telecommunications
Image Processing
Scheduling
Operations Research
Routing
Social Network Analysis
Recommendation Systems
Chemistry (Molecular Graphs)
Compiler Design
Electrical Circuits
Linguistics (Syntax Trees)
Transportation Networks
Web Search
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Graph Algorithms
|
|
gptkbp:includes
|
gptkb:Breadth-First_Search
gptkb:Depth-First_Search
gptkb:A*_Search_Algorithm
gptkb:Bellman-Ford_Algorithm
gptkb:Dijkstra's_Algorithm
gptkb:Edmonds-Karp_Algorithm
gptkb:Floyd-Warshall_Algorithm
gptkb:Ford-Fulkerson_Algorithm
gptkb:Kosaraju's_Algorithm
gptkb:Kruskal's_Algorithm
gptkb:Prim's_Algorithm
gptkb:Tarjan's_Algorithm
gptkb:Topological_Sort
|
|
gptkbp:relatedTo
|
Combinatorics
Network Theory
Data Structures
|
|
gptkbp:usedFor
|
gptkb:Minimum_Spanning_Tree
gptkb:Network_Flow
gptkb:Shortest_Path_Problem
Connected Components
Cycle Detection
Graph Traversal
Pathfinding
Strongly Connected Components
Topological Ordering
|
|
gptkbp:bfsParent
|
gptkb:Shimon_Even
|
|
gptkbp:bfsLayer
|
5
|