| Share this post! | Vote this! |
|
Graphs
are useful for representing many problems in computer science and in
the real world. Applications of graph representations range from the
seemingly simple, finding out whether a node is reachable from another node,
to the extremely complex, such as finding a route that visits each node and
minimizes the total time (the "travelling salesman" problem). A common, but
solvable problem is that of problem of simple path finding. Generally, the
task is determining the shortest path from a given node to any other node on
the graph.
Graphs are useful for representing many problems in computer science and in the real world. Applications of graph representations range from the seemingly simple, finding out whether a node is reachable from another node, to the extremely complex, such as finding a route that visits each node and minimizes the total time (the "travelling salesman" problem). A common, but solvable problem is that of problem of simple path finding. Generally, the task is determining the shortest path from a given node to any other node on the graph. more...
Graphs are useful for representing many problems in computer science and in the real world. Applications of graph representations range from the seemingly simple, finding out whether a node is reachable from another node, to the extremely complex, such as finding a route that visits each node and minimizes the total time (the "travelling salesman" problem). A common, but solvable problem is that of problem of simple path finding. Generally, the task is determining the shortest path from a given node to any other node on the graph. more...
0 comments:
Post a Comment