Is this transitive closure correct or not?

  • Context: MHB 
  • Thread starter Thread starter Natalie1
  • Start date Start date
  • Tags Tags
    closure
Click For Summary
SUMMARY

The discussion focuses on the concept of transitive closure as represented in an adjacency matrix. The adjacency matrix is used to illustrate the relationships between nodes in a graph, while the direct transitive closure indicates the number of steps required to reach one node from another. Specifically, the values in the closure column represent the minimum number of edges needed to connect the nodes, with 0 indicating no connection, 1 indicating a direct connection, and higher numbers indicating multiple edges. Understanding this representation is crucial for analyzing graph structures in computer science.

PREREQUISITES
  • Graph theory fundamentals
  • Adjacency matrix representation
  • Transitive closure concepts
  • Basic understanding of relations in mathematics
NEXT STEPS
  • Study the properties of adjacency matrices in graph theory
  • Learn algorithms for computing transitive closure, such as the Floyd-Warshall algorithm
  • Explore applications of transitive closure in database queries
  • Investigate graph traversal techniques, including Depth-First Search (DFS) and Breadth-First Search (BFS)
USEFUL FOR

Students of computer science, mathematicians, software developers working with graph algorithms, and anyone interested in understanding relationships in data structures.

Natalie1
Messages
7
Reaction score
0

Attachments

  • discrete.gif
    discrete.gif
    2.1 KB · Views: 116
Physics news on Phys.org
Could you explain what you mean by the table and especially by the column next to it?
 
It is an Adjacency matrix, on the right side is a direct transitive closure. Explain to me why the first one is 0, second - 1, third - 2 etc. I don't understand this transitive closure.
 
Natalie said:
It is an Adjacency matrix, on the right side is a direct transitive closure.
Transitive closure of a relation is another relation. It can be represented by its own adjacency matrix, but I don't understand how it is represented by a column.
 

Similar threads

Ukraine Thread Closure Reported - No Discussion Allowed?
  • · Replies 41 ·
2
Replies
41
Views
4K
High School Subspaces of Functions- definition
  • · Replies 8 ·
Replies
8
Views
2K
High School Are there two kinds of inverse with respect to closure?
  • · Replies 18 ·
Replies
18
Views
2K
Undergrad Uniform closure of algebra of bounded functions is uniformly closed
  • · Replies 2 ·
Replies
2
Views
2K
Medical Left Atrial Appendage (LAA) Closure for prophylactic A-fib treatment
  • · Replies 1 ·
Replies
1
Views
3K
Undergrad Dirichlet problem boundary conditions
  • · Replies 4 ·
Replies
4
Views
2K
Undergrad Interior and Closure in a Topological Space .... .... remark by Willard
  • · Replies 2 ·
Replies
2
Views
2K
Graduate Closure of relations betweens sets
  • · Replies 8 ·
Replies
8
Views
3K
Undergrad Proof for subgroup -- How prove it is a subgroup of Z^m?
  • · Replies 11 ·
Replies
11
Views
3K
Undergrad Closure & Interior as Dual Notions .... Proving Willard Theorem 3.11 ...
  • · Replies 2 ·
Replies
2
Views
2K