Find Jobs
Hire Freelancers

Coding Question on Acyclic Graph

₹600-1500 INR

Κλειστή
Αναρτήθηκε πάνω από 5 χρόνια πριν

₹600-1500 INR

Πληρωμή κατά την παράδοση
The partition graph G n = (V, E) for an integer n ≥ 2 is an acyclic digraph where V is the vertex set and E is the edge set such that • v ∈ V represents a partition of an integer n. • An edge (v i , v j ) ∈ E represents that an element in the partition at v i is decomposed into two parts to obtain v j and thus the number of elements in the partition associated with v j = 1 + the number of elements in the partition associated with v i . Number of nodes in the partition graph G n is equal to the partition number of n. The partition graph G 7 for an integer n = 7 is shown in Figure 1. A node in a partition graph G n is represented as Node = hnodeId, partition, childListi. • nodeId: It corresponds to the unique id assigned to each node. It is represented as Node.nodeId. • partition: It represents the partition of an integer n. It is denoted as Node.partition. • childList: It denotes the list of nodeIds of all the nodes whose corresponding partitions are generated from partition. It is denoted as Node.childList. From the Uploaded Image Example:- The partition graph G 7 has 15 nodes. Let a node be Node = hId 3 , h5, 2i , {Id 5 , Id 6 , Id 8 }i. Here the nodeId corresponding to the given node is Id 3 . The partition corresponding to the given node is h5, 2i. childList contains nodeIds of the nodes whose corresponding partitions are generated from the partition h5, 2i. The partitions which are generated from h5, 2i are h5, 1, 1i, h4, 2, 1i and h3, 2, 2i. So childList contains the nodeIds of the nodes corresponding to these generated partitions and the corresponding nodeIds are Id 5 , Id 6 and Id 8 . To Find:- Given a positive integer n ≥ 3. Do the following in an efficient manner. 1. Generate the corresponding partition graph. 2. Count the total number of nodes and total number of vertices in the partition graph. 3. Count the number of nodes at each level. 4. Obtain all the tree edges 5. Obtain all the back edges 6. Obtain all the forward edges
Ταυτότητα εργασίας: 18228833

Σχετικά με την εργασία

3 προτάσεις
Απομακρυσμένη Εργασία
Ενεργός/ή 5 χρόνια πριν

Ψάχνεις τρόπο για να κερδίσεις μερικά χρήματα;

Πλεονεκτήματα πλειοδοσίας στο Freelancer

Καθόρισε τον προϋπολογισμό σου και το χρονοδιάγραμμα
Πληρώσου για τη δουλειά σου
Περίγραψε την πρόταση σου
Η εγγραφή και η πλειοδοσία σε εργασίες είναι δωρεάν
3 freelancers δίνουν μια μέση προσφορά ₹1.776 INR για αυτή τη δουλειά
Avatar Χρήστη
Hi, Yes i go through your description and i can get this done for you I will get this done as per your requirement. Please come over to chat we will discuss further. waiting to hear back from you. Thanks in advance.@ Regards Ratnesh
₹1.300 INR σε 1 ημέρα
0,0 (0 αξιολογήσεις)
0,0
0,0
Avatar Χρήστη
This is a typical data structures problem, as the task is to create the partition graph some constraints must be imposed on the limit of the value for 'n' .I'm confident that I can provide you with a code in c++, once if the constraint on the value of n is manageable by me.
₹2.777 INR σε 5 ημέρες
0,0 (0 αξιολογήσεις)
0,0
0,0
Avatar Χρήστη
Checked you problem. Tried it and I am almost done with the task. A developer with an experience of more than 6 years. Keen to solve problems. Experienced in Java, OO Design principles. Believe in high performance and scalable code.
₹1.250 INR σε 1 ημέρα
0,0 (0 αξιολογήσεις)
0,0
0,0

Σχετικά με τον πελάτη

Σημαία της INDIA
NEEMRANA, India
0,0
0
Μέλος από Ιαν 14, 2016

Επαλήθευση Πελάτη

Ευχαριστούμε! Σου έχουμε στείλει ένα email με ένα σύνδεσμο για να διεκδικήσεις τη δωρεάν πίστωση σου.
Κάτι πήγε στραβά κατά την προσπάθεια αποστολής του email σου. Παρακαλούμε δοκίμασε ξανά.
Εγγεγραμμένοι Χρήστες Συνολικές Αναρτημένες Δουλειές
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Φόρτωση προεπισκόπησης
Δόθηκε πρόσβαση για Geolocation.
Η σύνδεση σου έχει λήξει και τώρα έχεις αποσυνδεθεί. Παρακαλούμε συνδέσου ξανά.