Concept information
Preferred term
graph algorithms
Type
-
http://www.irandoc.ac.ir/onto/irandoc-meta/Concept
Broader concept
Narrower concepts
- algorithm for articulation point
- bellman-ford algorithm
- computing of block algorithm
- dijkstra algorithm
- directed eulerian circuit algorithm
- fleury algorithm
- ford-fulkerson algorithm
- greedy algorithm
- hill climbing algorithm
- hungarian algorithm
- kruskal algorithm
- mdst algorithm
- planarity algorithm
- prim algorithm
- shortest path algorithm
- sulin algorithm
In other languages
-
Persian
URI
http://www.irandoc.acir/onto/irandoc/math0002776
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}