Skip to content

Graph Algorithms And Combinatorial Optimization

← Back to Domain-Specific Abstractions by Domain

1 domain-specific abstractions whose origin domain is Graph Algorithms And Combinatorial Optimization.

  • Shortest path problem — The optimization problem of finding a path between specified graph vertices whose accumulated edge or path weight is minimal among all admissible paths.