by Dinesh Thakur Category: Graphs

**Shortest path** can be calculated only for the weighted graphs. The edges connecting two vertices can be assigned a nonnegative real number, called the weight of the edge. A graph with such weighted edges is called a weighted graph.

by Dinesh Thakur Category: Graphs

Processing a graph requires the ability to traverse the graph. Traversing a graph is similar to traversing a binary tree, except that traversing a graph is a bit more complicated. Recall that a binary tree has no cycles. Also, starting at the root node, we can traverse the entire tree.

About Dinesh Thakur

Dinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular Computer Notes blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to Contact us.

Search Content

Basic Courses

Advance Courses

- CPU Scheduling Algorithms
- What is real-time operating system (RTOS)? - Definition
- Definition of Multitasking Operating System
- Types of Computer Memory
- What is SDRAM (synchronous DRAM)? - Definition
- What is Non-Volatile Random Access Memory (NVRAM)? - Definition
- Relational Algebra - What is Relational Algebra?