Graph Processing Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - "---- ---- [[Category" to "---- ---- __NOTOC__ [[Category") |
||
| Line 11: | Line 11: | ||
---- | ---- | ||
---- | ---- | ||
__NOTOC__ | |||
[[Category:Concept]] | [[Category:Concept]] | ||
Revision as of 16:29, 18 March 2021
A Graph Processing Algorithm is a processing algorithm that can process a graph data structure.
- Context:
- It can be applied by a Graph Processing System, such as a graph processing library.
- …
- Example(s):
- Counter-Example(s):
- See: Dijkstra Algorithm.