Lưu ý: Bản dịch của mục này hiện đang được kiểm tra chất lượng, vì vậy một số nội dung tạm thời chỉ hiển thị bằng tiếng Anh.
Mục từ này chưa được dịch sang ngôn ngữ của bạn, vì vậy nội dung gốc được hiển thị bên dưới.
undirected graph
This term is a technical specification used primarily in discrete mathematics, computer science, and network analysis. It describes a structure where the connection between two nodes is mutual, implying that if node A is connected to node B, then node B is automatically connected to node A. This contrasts with a directed graph (digraph), where edges have a specific direction, similar to a one-way street.
In practical application, this is used to model symmetric relationships, such as a friendship on a social network where both parties must be connected, or a physical cable connecting two computers. It is a formal term and is rarely used outside of academic or technical documentation.
Ý nghĩa
Ví dụ
An undirected graph represents a symmetric relationship between nodes.
An undirected graph represents a symmetric relationship between nodes.
We can model the social network as an undirected graph where edges represent friendships.
Is this an undirected graph or a directed one?
The adjacency matrix for an undirected graph is always symmetric.
I need to implement a breadth first search on this undirected graph.
Let us assume the network is an undirected graph for the sake of simplicity.
The problem asks for the shortest path in an undirected graph.
Wait, if the edges have no direction, then it is just an undirected graph.