---
license: openrail
pipeline_tag: fill-mask
language:
- en
widget:
- text: "Dijkstra's algorithm is an algorithm for finding the [MASK] paths between nodes in a weighted graph"
  example_title: "Djikstra"
  
- text: "This concludes the [MASK]."
  example_title: "0a"
  
- text: "We show this by [MASK]."
  example_title: "0b"
  
- text: "By [MASK]'s inequality."
  example_title: "inequalities"
  
- text: "The [MASK] is definite positive."
  example_title: "0c"
  
- text: "In particular any field is a [MASK]."
  example_title: "0d"
  
- text: "To determine the shortest distance in a graph, one can use [MASK]'s algorithm."
  example_title: "algorithm"
  
- text: "An illustration of the superiority of quantum computer is provided by [MASK]'s algorithm."
  example_title: " algorithm name"
  
- text: "One of the ways of avoiding [MASK] is using cross validation, that helps in estimating the error over test set, and in deciding what parameters work best for your model."
  example_title: "Machine learning"
---