Tsp#
- class Tsp(graph)[source]#
Bases:
GraphOptimizationApplication
Optimization application for the "traveling salesman problem" [1] based on a NetworkX graph.
References
[1]: "Travelling salesman problem", https://en.wikipedia.org/wiki/Travelling_salesman_problem
- প্যারামিটার:
graph (Graph | ndarray | List) -- A graph representing a problem. It can be specified directly as a NetworkX graph, or as an array or list format suitable to build out a NetworkX graph.
Attributes
- graph#
Getter of the graph
- রিটার্নস:
A graph for a problem
Methods
- static create_random_instance(n, low=0, high=100, seed=None)[source]#
Create a random instance of the traveling salesman problem
- draw(result=None, pos=None)#
Draw a graph with the result. When the result is None, draw an original graph without colors.
- প্যারামিটার:
result (OptimizationResult | ndarray | None) -- The calculated result for the problem
- static parse_tsplib_format(filename)[source]#
Read a graph in TSPLIB format from file and return a Tsp instance.
- প্যারামিটার:
filename (str) -- the name of the file.
- রেইজেস:
QiskitOptimizationError -- If the type is not "TSP"
QiskitOptimizationError -- If the edge weight type is not "EUC_2D"
- রিটার্নস:
A Tsp instance data.
- রিটার্ন টাইপ:
- static sample_most_likely(state_vector)#
Compute the most likely binary string from state vector.
- প্যারামিটার:
state_vector (QuasiDistribution | Statevector | ndarray | Dict) -- state vector or counts or quasi-probabilities.
- রিটার্নস:
binary string as numpy.ndarray of ints.
- রেইজেস:
ValueError -- if state_vector is not QuasiDistribution, Statevector, np.ndarray, or dict.
- রিটার্ন টাইপ: