Book edition 7th

Author(s) Kenneth H. Rosen

Pages 808 pages

ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Short Answer

Adapt Algorithm 1 to find the reflexive closure of the transitive closure of a relation on a set with \(n\) elements.

procedure reflexive closure of transitive closure ( \({M_R}:\) zero-one \(n*n\) matrix)

We first determine the transitive closure, which is thus identical to the Warshall algorithm.

\(A: = {M_R}\)

\(B = A\)

fori: \( = 2\) to \(n\)

\(A: = A \supseteq {M_R}\)

\(B: = B \vee A\)

forj: \( = 1\) to \(n\)

\({W_{ij}}: = 1\)

return

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :

TABLE OF CONTENTS

Step 1: Given data

Reflexive closure of the transitive closure of a relation on a set with \(n\) elements. The shortest path between two vertices in a directed graph.

Step 2: Concept used of algorithm

Algorithms are used as specifications for performing calculations and data processing.

Step 3: Find the reflexive closures

There are two ways to go.

One approach is to take the output of Algorithm as it stands and then make sure that all the pairs (a, a) are included by forming the join with the identity matrix

\(\left( {} \right.\)specifically \(\left. {{\mathop{\rm set}\nolimits} {\bf{B}}: = {\bf{B}} \vee {{\bf{I}}_n}} \right)\).

The other approach is to insure the reflexivity at the beginning by initializing \({\bf{A}}: = {M_r} \vee {{\bf{I}}_n}\); if we do this, then only paths of length strictly less than \(n\) need to be looked at, so we can change the \(n\) in the loop to \(n - 1\).

Find Study Materials for

Create Study Materials

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

Adapt Algorithm 1 to find the reflexive closure of the transitive closure of a relation on a set with \(n\) elements.

Step by Step Solution

Step 1: Given data

Step 2: Concept used of algorithm

Step 3: Find the reflexive closures

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

Adapt Algorithm 1 to find the reflexive closure of the transitive closure of a relation on a set with \(n\) elements.

Step by Step Solution

Step 1: Given data

Step 2: Concept used of algorithm

Step 3: Find the reflexive closures

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Decision Maths

Calculus

Probability and Statistics

Statistics

Mechanics Maths

Geometry

Pure Maths