bar graph
The answer depends on what the graph is of: the distribution function or the cumulative distribution function.
It has no special name - other than a normal (or Gaussian) distribution graph.
for plat5o users the answer is an age distribution diagram
Tables and graph represent relations by showing the distribution of occurrence.
graph of modulus
No, Dijkstra's algorithm cannot handle negative weights in a graph.
The bell curve graph is another name for a normal (Gaussian) distribution graph. A Gaussian function is a certain kind of function whose graph results in a bell-shaped curve.
The answer depends on what the graph is of: the distribution function or the cumulative distribution function.
It has no special name - other than a normal (or Gaussian) distribution graph.
frequency is the kinds of the line graph, bar graph, picture graph, pie graph. that's all
A scatter graph.
The Dijkstra algorithm cannot handle negative weights in a graph because it assumes all edge weights are non-negative. If negative weights are present, the algorithm may not find the shortest path correctly.
No it is not. The ogive is a graph that represents the cumulative frequencies for the classes in a frequency distribution.
In a weighed graph, a negative cycle is a cycle whose sum of edge weights is negative
for plat5o users the answer is an age distribution diagram
A normal distribution is symmetrical; the mean, median and mode are all the same, on the line of symmetry (middle) of the graph.
Dijkstra's algorithm does not work well with negative weights in a graph because it assumes all edge weights are non-negative. Negative weights can cause the algorithm to give incorrect results or get stuck in an infinite loop. To handle negative weights, a different algorithm like Bellman-Ford should be used.