Weighted graph - A graph in which edges are given a value (labelled), Simple graph - A graph without multiple edges and in which each edge connects two different vertices, Path - A sequence of edges from one vertex to another, Circuit - A succession of edges that start and end at the same vertex, Cycle - A circuit in which all the edges are different and all the intermediate vertices are different, Explorer’s problem - A route that traverses each road edge exactly once before returning to the starting point, Traveller’s problem - A route that visits each vertex exactly once before returning to the starting point, Undirected graph - A graph where there is no direction associated with an edge, i.e. lines not arrows,

Graphs 2

印刷
埋め込み

リーダーボード

表示スタイル

オプション

テンプレートを切り替える

自動保存: を復元しますか?