Topological sort requires only a tiny addition to the DFS algorithms. Exactly one of the following data structures is required t
1 answer:
You might be interested in
Answer:
I am going to use the Python programming language to answer this. The source code is given below:
print("Enter your tweet here")
user_tweet = input()
decoded_tweet = user_tweet.replace('TTYL', 'talk to you later')
print("This is the decoded tweet: ")
print(decoded_tweet)
Explanation:
In the program the replace() module was used to replace 'TTYL' with 'talk to you later.'
Attached is the screenshot of the output.
Answer:
- from matplotlib import pyplot as plt
- with open("text.txt") as file:
- data = file.readlines()
- category = []
- amount = []
- for row in data:
- values = row.split(" ")
- category.append(values[0])
- amount.append(float(values[1]))
- figure = plt.figure()
- ax = figure.add_axes([0,0,1,1])
- ax.axis('equal')
- ax.pie(amount, labels = category, autopct='%1.2f%%')
- plt.show()
Explanation:
Firstly, we need to import matplotlib library (Line 1).
Next, open a file stream and use readlines method to read the data from the text file (Line 4). Presume the data read from the text files are as follows:
Rent 450
Gas 150
Food 500
Clothing 120
Car 600
Create two lists, category and amount (Line 5-6). Use a for loop to traverse through the read data and use split method to break each row of data into two individual items. The first item is added to category list whereas the second item is added to amount list (Line 7 - 10).
Next, create a plot figure and then add the axes (Line 12 - 13). We can use the pie method to generate a pie chart (Line 15) by setting the amount list as first argument and category list as value of labels attributes. The output pie chart can be found in the attachment.
