|
gptkbp:instanceOf
|
gptkb:architecture
|
|
gptkbp:canBe
|
directed
unweighted
weighted
undirected
|
|
gptkbp:consistsOf
|
edges
vertices
|
|
gptkbp:hasProperty
|
sparse
dense
connected
disconnected
acyclic
cyclic
|
|
gptkbp:hasType
|
gptkb:tree
gptkb:planar_graph
graph
bipartite graph
cycle
connected graph
simple graph
disconnected graph
multigraph
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Graph (data structure)
|
|
gptkbp:relatedTo
|
gptkb:network_protocol
adjacency matrix
adjacency list
tree (data structure)
|
|
gptkbp:represents
|
adjacency matrix
incidence matrix
adjacency list
|
|
gptkbp:studiedIn
|
discrete mathematics
graph theory
|
|
gptkbp:supportsAlgorithm
|
gptkb:Kosaraju's_algorithm
gptkb:Kruskal's_algorithm
gptkb:Prim's_algorithm
gptkb:breadth-first_search
gptkb:Dijkstra's_algorithm
gptkb:A*_search_algorithm
gptkb:Tarjan's_algorithm
gptkb:Bellman-Ford_algorithm
gptkb:Floyd-Warshall_algorithm
depth-first search
topological sort
|
|
gptkbp:usedFor
|
network analysis
social networks
web page ranking
pathfinding
dependency analysis
modeling relationships
|
|
gptkbp:usedIn
|
computer science
|
|
gptkbp:bfsParent
|
gptkb:Graph_Algorithms
|
|
gptkbp:bfsLayer
|
6
|