Coddicted - Page 11 of 34 - Codes.Notes.Tutorials.

Sine and Cos graph

Sine and Cos graph
Back To Top

Null Reference

Null Reference
Back To Top

Count Triangles in a Graph 1

The following code implementation counts the number of triangles present in a graph G. For graph representation JUNG API is used but can be extended/ changed to use any other notation by simple means. Java import java.util.Collection; import java.util.HashSet; import java.util.Iterator; import edu.uci.ics.jung.graph.Graph; public class TriangleFinder { private Graph<Integer, String> g; /** * @return The ...

Know your bulb

Know your bulb
Back To Top

Dijkstra’s Algorithm : Finding all possible shortest paths between two vertices in a graph 2

Dijkstra's Algorithm : Finding all possible shortest paths between two vertices in a graph
The following code implements the Dijkstra’s Shortest Path Algorithm and further extends is to get all possible shortest paths between two vertices. For graph representation we make use of JUNG API, its usage, however, is primarily in visualizing the graph and can be extended easily for any other representation as well. Random Graph Generator code ...

Code for Random Graph Generation G(n,p) 1

Code for Random Graph Generation G(n,p)
Following is the Java code for generating a Random Graph G(n, p) where ‘n’ is the number of nodes/ vertices in the graph and ‘p’ is the probability that any edge will form or not. The code makes use of JUNG API for graph visualization and creation. More About JUNG… Java import java.awt.Dimension; import javax.swing.JFrame; ...

2048

2048
click (here) to play Back To Top

ConcurrentHashMap 1

ConcurrentHashMap
Javadoc says… “A hash table except supporting full concurrency of retrievals and adjustable expected concurrency for updates. This class obeys the same functional specification as Hashtable, and includes versions of methods corresponding to each method of Hashtable. However, even though all operations are thread-safe, retrieval operations do not entail locking, and there is not any ...

Reviewed – Codelobster PHP Edition

Reviewed - Codelobster PHP Edition
With increasing complexity and options available for website development works, a handy and comfortable editor/ IDE is a necessity. In this respect, if an editor is available for free it would certainly be a great relief. Here we feature one such editor for PHP based web development – Codelobster PHP Edition . Some important features of ...

Matlab code to create k-connected Harary Graph 4

Matlab code to create k-connected Harary Graph
The following is a MATLAB script to create a k-connected Harary Graph of n-nodes. Clearly the inputs required are n (no of nodes) and k (degree of each node). Also, while the code is a MATLAB script the basic technique to generate the adjacency matrix of the graph can be easily adopted to other languages ...