Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / hr@tgksolutions.com
A specific kind of data structure that has a collection of ordered pairings is called a graph.
Another name for the ordered pairs in a graph is arcs or edges. Connecting nodes where data can be stored and accessed is their most popular use.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What are the applications of linked list?
What is indexing an array?
Is map a collection?
What is concurrentlinkeddeque?
What is meant by binary tree?
How does bogo sort work?
What are the differences between b tree and b+ tree?
What is array simple?
Is collection a class or interface?
Is hashmap keyset ordered?
What is a linear search?
Why do we need to use computers to help us sort lists?
How remove all from arraylist?
Is hashmap faster than arraylist?
What is stable sort example?
