0
If u want 2 find shortest path between any 2 nodes
tak 1 source vertice and 1 destination vertice
the minimum number of vertices which comes while traversing from source to destination vertice will give you ur answer
that is,try to cover minimum o of vertices whil traversing.
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
How many nodes are in a family branch tree in graph theory?
In Mathematics and Computer Science, the graph theory is just the theory of graphs basically overall. It's basically the relationship between objects. The nodes are just lines that connects the graph. There are a total of six nodes in a family branch tree for a graph theory basically.
What is spanning tree in data structure?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.
What is Dijkstra's algorithm?
Dijkstra's algorithm is used by the OSPF and the IS-IS routing protocols. The last three letters in OSPF (SPF) mean "shortest path first", which is an alternative name for Dijkstra's algorithm.
How do you get edge value between two nodes in graph using java?
That depends how the data is stored. If you use predesigend classes to store information about nodes and edges, check the documentation of the specific class or classes. Or ask a question here, specifiying the class you are using.
What is the difference between Local Bridge and Remote Bridge?
Local bridges are ties between two nodes in a social graph that are the shortest (and often the only plausible) route by which information might travel from those connected to one to those connected to the other. [2] Local bridges differ from regular bridges in that the end points of the local bridge cannot have a tie directly between them and should not share any common neighbors. never found any answers in answers. sucks
How many nodes are in a family branch tree in graph theory?
In Mathematics and Computer Science, the graph theory is just the theory of graphs basically overall. It's basically the relationship between objects. The nodes are just lines that connects the graph. There are a total of six nodes in a family branch tree for a graph theory basically.
How can you design an algorithm to check if a given graph is connected?
Use a simple DFS/BFS traversal. If you have gone through all nodes, the graph is connected.
What is spanning tree in data structure?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.
What is Dijkstra's algorithm?
Dijkstra's algorithm is used by the OSPF and the IS-IS routing protocols. The last three letters in OSPF (SPF) mean "shortest path first", which is an alternative name for Dijkstra's algorithm.
What are the difference between graph and trees in c?
Graphs and trees are often used as synonyms for lattices or networks of interlinked nodes. A graph is the more general term and essentially covers all types of lattices and networks including trees, while a tree is a more specific type of graph, not unlike a family tree extending downwards much like the roots of a tree. A binary tree is a typical example of a tree-like graph. Non-tree-like graphs are typically used to model road maps and thus help solve travelling salesman problems, such as finding the shortest or fastest route between a given set of nodes. Real-life computer networks can also be modelled using graphs. And unlike trees which are two-dimensional structures, graphs can be multi-dimensional.
Generally What is meant by graph?
'Graph' comes from a Greek word meaning 'write', so it relates to things that appear on paper or on screen. The answer really depends on the context. For instance in computer science a graph is a set of nodes and edges that go between the nodes. In other subjects it may mean a diagram representing the relationship between two sets of numbers, often the input and output of a function. In other contexts it may mean a pictorial chart...
What are the advantages of Router?
Routers allow data packets to travel faster on a computer network. This is by determining the shortest and best route between the sending and receiving nodes.
What is directed graph?
It's a set of nodes, together with edges that have directions associated with them.
How many triangles are there in a complete graph?
The number of triangles in a complete graph with n nodes is n*(n-1)*(n-2) / 6.
How do you get edge value between two nodes in graph using java?
That depends how the data is stored. If you use predesigend classes to store information about nodes and edges, check the documentation of the specific class or classes. Or ask a question here, specifiying the class you are using.
How do you describe Branches?
lineage segments between nodes or between nodes and tips of the tree.
What is dense graph and sparse graph?
Sparse vs. Dense GraphsInformally, a graph with relatively few edges is sparse, and a graph with many edges is dense. The following definition defines precisely what we mean when we say that a graph ``has relatively few edges'': Definition (Sparse Graph) A sparse graph is a graph in which .For example, consider a graph with n nodes. Suppose that the out-degree of each vertex in G is some fixed constant k. Graph G is a sparse graph because .A graph that is not sparse is said to be dense:Definition (Dense Graph) A dense graph is a graph in which .For example, consider a graph with n nodes. Suppose that the out-degree of each vertex in G is some fraction fof n, . E.g., if n=16 and f=0.25, the out-degree of each node is 4. Graph G is a dense graph because .
