例句與造句

1. If one represents a nondeterministic abstract machine as a graph where vertices describe states and edges describe possible transitions, shortest path algorithms can be used to find an optimal sequence of choices to reach a certain goal state, or to establish lower bounds on the time needed to reach a given state.
2. These algorithms are based on two different principles, either performing a shortest path algorithm such as Dijkstra's algorithm on a visibility graph derived from the obstacles or ( in an approach called the " continuous Dijkstra " method ) propagating a wavefront from one of the points until it meets the other.
3. In order to add each new edge in a way that minimizes the number of crossings it forms, one can use a shortest path algorithm in the dual graph of the current embedding, in order to find the shortest sequence of faces of the embedding and edges to be crossed that connects the endpoints of the new edge to each other.
4. Transforming a directed graph with cycles into a DAG by deleting as few vertices or edges as possible ( the feedback vertex set and feedback edge set problem, respectively ) is NP-hard, but any directed graph can be made into a DAG ( its longest paths can be solved on DAGs in linear time, in contrast to arbitrary graphs for which shortest path algorithms are slower and longest path problems are NP-hard.
5. It's difficult to find shortest path algorithms in a sentence. 用shortest path algorithms造句挺難的
更多例句：  上一頁