道 (グラフ理論)
1. Path (graph theory)In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. A path may be infinite, but a finite path always has a first vertex, called its start vertex, and a last vertex, called its end vertex. Both of them are called terminal vertices of the path. The other vertices in the path are internal vertices. A cycle is a path such that the start vertex and end vertex are the same.
Read “Path (graph theory)” on English Wikipedia
Read “道 (グラフ理論)” on Japanese Wikipedia
Read “Path (graph theory)” on DBpedia
Read “Path (graph theory)” on English Wikipedia
Read “道 (グラフ理論)” on Japanese Wikipedia
Read “Path (graph theory)” on DBpedia
Discussions
Log in to talk about this word.