Chinese postman problem
(graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.
Alternative form of grasp at straws
(zoology) Of or pertaining to the Ptenoglossa.
Third-person singular simple present indicative form of wolf down
アルゴリズムの授業で、グラフのすべての辺を訪れる最短の閉路を求める問題を解くアルゴリズムを実装し、いくつかのグラフでその性能を測定しました。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★
