Simple Graph Path

A Simple Graph Path is a Graph Path that does not visit a Graph Node more than once.

• See: Connected Graph.

---

---

References

2009

• http://en.wikipedia.org/wiki/Glossary_of_graph_theory
  • path: A route that does not pass any edge more than once. If the path does not pass any node more than once, it is a simple path.

---