vs140580

495 Reputation

8 Badges

4 years, 180 days

MaplePrimes Activity


These are replies submitted by vs140580

@lcz  (the codes  contributed by Carl Love)

 I attach pdf

 Help_(2).mw

Help_(2).pdf

I use Maple 2020 could it be a problem Kind help 

 

Kind help it will be acknowleged

@Carl Love 

 

I am getting a small error when I excecute the function kind help I need help please help 

Help.mw  Help.pdf

@lcz 

I am getting a small error when I excecute the function kind help 

Help.mw

@vs140580 let both the matrices be the same matrix say A

 

Now other the same row will their be any other row such that their is this property 

This condition of not the same row when both the matrix are same

This is also important

Today once I reach office I will provide more examples where this will occur 

@Carl Love That is what i expected they will not be such cases

A=Matrix([[1,1,2,3,4],[4,1,5,6,7]]):

B=Matrix([[1,5,6,7],[1,1,4,3,2]]):

say example to see it occurs in the first with secod case so it shoud reject

@Carl Love Test_matrices_1.mw

Link given kind help

@Carl Love you are correct but interior can be any cyclic permutation it be a odd number of elements in the middle too

You can have 4 Below 4 too in some that is some a below a in some places

That is all possible

If any such exists on the comparisons

Any row of A with any row of B after the padding please print those row numbers and rows

If no such exists at all print out at the end no such existed in this set of matrix

Every R1 of A. Need to be equal to any R2 of B based the condition

If it happens then it will print those

and also

First We label the graph G with V with lists of type [1,a1,a2,a3,.......,an,k1] and

So now let us say I label a graph G with some sets of type V and some edges E

Now from the edges  E of the set of edges 

if v1 is vertex [1,a1,a2,a3,.......,an,k1] in V and v2 is a vertex [1,b1,b2,b3,.......,bn,k2] in V

Then v1v2 we add a new edge to E1 sets if the condition satisfies and vertex set will be V itself

Now print set E1 and V and Draw the graph G1=(E1,V) something like a induced subgraph.

Kind help please please please sir

Anyone looking at this question please help with the related question in the below link

https://www.mapleprimes.com/questions/234649-A-New-Type-Of-Equality-Of-Matrices-Checking?sq=234649

@mmcdara 

Even if in the comparisions of any R1 of A with any R2 of B it repllies same then we are say then it is FALSE it should printout those rows in which they are same as per that condintion given the equaling.

If no row R1 of A is same as no Row R2 B as per condition then only it is true

@Carl Love Help with it later

Even if in the comparisions of any R1 of A with any R2 of B it repllies same then we are say then it is True it should printout those rows in which they are same as per that condintion given the equaling.

If no row R1 of A is same as no Row R2 B as per condition then only it is true

@Carl Love 

If it returns false what it means does it mean companing all rows with all rows returned false all are not equal per my condition 

If it returns true what it means in your code 

Kind help sir

If possible if the rows where same in some place if possible help in printing the Row numbes the elements of those rows kind help so that it will be useful for me please please please help it will be useful

@lcz But I need the graph even it is length and width are big 

I need to see the vertex a big labels , edges how they are moving exactly in the graph more clearly which edge is exactly from which vertex to which after converting to pdf 

Could I get your guidance for just the same example can we be able to that 

 

May be difficult sir so I credit you for your attempt thank you sir 

@Carl Love  i changed to Maple Input that line but only in that line error kind help error_in_my_system.mw

 

May be if possible to help put those lines in mw file attach and send

As it works when I copy from me file to another

 

I am not able track the error 

@Carl Love

1)  which are the sets which dont cover all the vertices based on the algorithm and what is its maximum size.

2) And Make this negibours as a property function  that is if I want property neighbhorhood we will take that if some other we will take that 

@Carl Love I apologize i did that immediately Thank you please help in the others kind help

As my remaing codes are in 2D inputs please help in 2D inputs please kind help please

5 6 7 8 9 10 11 Page 7 of 11