The following program reads a set of edges that define an undirected graph and creates a representation of this graph with an adjacency matrix, giving a[i][j] and a[j][i] the value of 1 if there is an edge from i to j or from j to i in the graph, or the value of 0 if it does not exist. Also, we assume that the number of vertices V is a constant known at compilation time. Otherwise, there should be dynamic memory allocation for the array that represents the adjacency matrix.
-
Recent Posts
Categories
- Articles (92)
- Artificial Intelligence (37)
- Compilers & Interpreters (15)
- Data Structures & Algorithms (27)
- Desktop Applications (4)
- Electronic Games (7)
- Embedded Systems (55)
- Events (24)
- Hobbies (4)
- Internet Applications (18)
- Libraries & Frameworks (15)
- News (6)
- Numerical Methods (7)
- Operating Systems (10)
- Projects (82)
- Security Systems & Access Control (11)
- Tools & Filters (9)
- Writings (1)
Calendar
June 2023 M T W T F S S 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 Archives
- February 2023 (1)
- July 2021 (1)
- April 2021 (17)
- October 2019 (2)
- March 2019 (4)
- October 2018 (1)
- September 2018 (1)
- July 2018 (2)
- June 2018 (1)
- March 2017 (1)
- February 2017 (1)
- July 2016 (2)
- March 2015 (1)
- October 2014 (9)
- September 2014 (1)
- May 2014 (8)
- March 2014 (1)
- February 2014 (1)
- December 2013 (2)
- June 2013 (4)
- May 2013 (7)
- March 2013 (1)
- February 2013 (1)
- January 2013 (1)
- October 2012 (8)
- September 2012 (12)
- July 2012 (1)
- May 2012 (2)
- April 2012 (1)
- January 2012 (2)
- December 2011 (1)
- October 2011 (2)
- August 2011 (1)
- June 2011 (1)
- May 2011 (4)
- March 2011 (20)
- February 2011 (13)
- December 2010 (5)
- November 2010 (2)
- October 2010 (10)
- September 2010 (13)
- August 2010 (10)
- July 2010 (10)
- June 2010 (20)
Tags
.NET 2D 3D 3D vector 74HC595 access control adaptive random search adjacency list adjacency matrix adventure adversarial examples agents alarm algorithm allocation amoeba method Android AngularJS animation ant colony optimization API Arduino aristotle Aristotle University of Thessaloniki array artificial immune artificial life assembly associativity AT&T syntax auction AUTH authentication average value bargraph Base64 Ben 10 Bernoulli BGC binary numbers binary search binary tree birthdays bison bitmap black box blog booking breadth-first breathalyzer button C# caching calculation calculator calibration celebrations cell life game changepoint detection checksum circular clapping Classic 3x3 class template clean backup files client climbing clinic clock alarm closest point cloud native clustering comments communities comparison compiler computational intelligence computer vision conflict connectivity problem content-based image retrieval content management system controller convolutional neural network cosine similarity critical region crossover cross product crowdspeak cryptography cube cultural daemon dangling else data science DC motor deadlock Debian deep artificial neural networks deep learning defensive programming DHCP diagnoses diary dictionary differential digital image processing directive distance calculation DNS documentation double comparison doxygen dynamic EAGAIN edges EEPROM EINTR electronics elimination elitism Emacs email address email domain checking email spam avoiding email syntax checking entropy equality equation solver Eratosthenes erratic sensor ethernet ethernet shield Euclidean distance EWOULDBLOCK expression extended fgets face de-identification face recognition factorial fashion mnist feature engineering feature extraction feature selection file descriptor financial summarization find command finding primes find occurrences FIPA fire alarm First-Price Sealed-Bid flex float float comparison free free software frequency histogram FSF game Gameduino game of life GAN Gauss gaussian noise generative adversarial networks generic Generic Repository genetic genetic programming genetic routing geographic geolocation getnameinfo getsockname GIS github GNU/Linux GNU history GNU project google maps gradient descent grammar graph Graph Database greatest common divisor Greek conference grep GSM Hackathon hanoi harmony search hello world high-bias high-variance hill climbing HMAC hostname hotel Hotspot HTML5 HTTP hyperparameter tuning I/O i18n icip identifier image captioning image segmentation include infix information hiding Infosystem infrared receiver inner product insertion sort integer interrupt ip agnostic iPhone ipv4 ipv6 iterated local search Jade Javascript Josephus problem jQuery Json.NET jumpy sensor kernel keypad knn algorithm kube academy kubernetes language models LCD LEDs level-order lexer library light bulb light sensor linear regression linked list linker LISP literal location-based location detection Log4Net logistic regression lrelease lupdate machine learning macro magic management application mapping markup languages mean filter median filter memetic memory Mini 2x2 model evaluation model selection model training model tuning mongodb mood light Morse motion detector motor movement MPM MQ-3 sensor Muller multi-factor authentication Multi-Processing Module multiline mutation MVW nasm natural language processing nature inspired NEC nelder-mead Neo4j neural activations neural network neural networks nlp node.js non-blocking non-deterministic errors normalize numerical method NxN OpenCV OpenGL open source opinion mining optimization OSHACKERS overfitting parallel parking parser path compression patients PBKDF2 persistence of vision philosophy photoresistor physical PID piezo speaker PING PIR sensor platform plato police POSIX postfix potentiometer POV precedence prefix preorder preprocessor prescriptions presentation prewitt edge detector privacy protection probability theory process Professor 5x5 program generator pseudodevice pthread puzzle Pythagorean theorem QPushButton QSettings QTest Qt framework Qt Linquist queue quick-union quick find race condition rainbow tables random image random numbers random search random text messages reception record recursion Refugee regular expression relay reminder replica set replication repository resource manager RESTful RestSharp Revenge 4x4 reverse lookup tables review RFID Richard Stallman rooms root-finding rotation angle rotation speed roulette wheel routes Rubik salt & pepper noise salted hashing scheduler search string Second-Price Sealed-Bid sed self-organizing map seminar sequential search server service servo sharding shell shunting-yard sieve signal dispatcher signal handler signal handlers signal management simplex simulated annealing simulation SIRC sketch smoothing sobel edge detector social network sockets software repairing SoftwareSerial software testing SOM SON sort sort strings source code SPA spam Sparkfun speaker sphere sprite engine stack start state steady-state Stefano Zacchiroli steganography stochastic storing settings strcmp strcpy string functions string processing strings string searching strlen strncmp stylesheet sudoku solver svm swarm swarm intelligence symbol table symmetry breaking syntax syntax tree system call T.E.I. of Central Macedonia temperature sensor Terranova The Crime Tracer TheHackerspace Thessaloniki three-dimensional time-based time series time series segmentation token transaction transformation translate traverse treatments tree trials sequence ultrasonic underfitting undirected Unit Of Work unit testing urandom V-Cube 6x6 vector math vehicle vertices virtual machine visual skills voice commands VRBot web Webduino weight agnostic neural networks weighted quick-union words counter wrapper xargs XML XSLT zero-player zombie processStatistics
- 313,414 hits
- Follow Efstathios Chatzikyriakidis on WordPress.com
Efstathios Chatzikyriakidis 